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 listMay 19, 2026 06:47Victor MerckléVictor MerckléScore: 24,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 06:5024,465213,653,681202,040,0001,025,0002,113,536
2May 19, 2026 06:5024,487211,075,412202,212,0001,031,0002,113,536
3May 19, 2026 06:5024,506211,407,593202,385,0001,023,0002,113,536
4May 19, 2026 06:5024,531211,468,999202,579,0001,035,0002,113,536
5May 19, 2026 06:5024,626212,187,824203,391,0001,005,0002,113,536
6May 19, 2026 06:5024,631212,221,719203,396,0001,044,0002,113,536
7May 19, 2026 06:5024,643212,362,422203,507,0001,038,0002,113,536
8May 19, 2026 06:5024,644213,034,841203,546,0001,007,0002,113,536
9May 19, 2026 06:5024,994215,540,894204,366,0003,090,0002,113,536