Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJun 19, 2026 06:49Victor MerckléVictor MerckléScore: 42,696Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 06:4942,648361,596,776352,854,0001,128,0002,113,536
2Jun 19, 2026 06:4942,664361,744,153353,077,0001,035,0002,113,536
3Jun 19, 2026 06:4942,664361,810,747353,058,0001,056,0002,113,536
4Jun 19, 2026 06:4942,673361,824,275353,157,0001,031,0002,113,536
5Jun 19, 2026 06:4942,696362,004,995353,340,0001,037,0002,113,536
6Jun 19, 2026 06:4942,710362,114,755353,415,0001,081,0002,113,536
7Jun 19, 2026 06:4942,726362,283,610353,607,0001,027,0002,113,536
8Jun 19, 2026 06:4942,806362,811,824354,268,0001,027,0002,113,536
9Jun 19, 2026 06:4942,880363,943,409354,885,0001,019,0002,113,536