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 14, 2026 04:11Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 04:11067,544,88458,375,00002,113,536expected "53692994874846651 ", got "53692971834846651 "
2May 14, 2026 04:117,03365,681,80458,382,00002,113,536
3May 14, 2026 04:117,03765,677,56658,409,00002,113,536
4May 14, 2026 04:117,04067,161,58157,379,0001,058,0002,113,536
5May 14, 2026 04:117,04068,596,38257,427,0001,010,0002,113,536
6May 14, 2026 04:117,04567,840,58958,474,00002,113,536
7May 14, 2026 04:117,04665,779,41757,438,0001,047,0002,113,536
8May 14, 2026 04:117,05968,015,16257,551,0001,039,0002,113,536
9May 14, 2026 04:117,09468,296,24757,866,0001,019,0002,113,536