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 listSep 14, 2026 00:22drewbumpasdrewbumpasScore: 52,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:2252,789448,297,202437,152,0001,003,0002,113,536
2Sep 14, 2026 00:2252,791448,447,101437,163,0001,005,0002,113,536
3Sep 14, 2026 00:2252,793449,533,969437,181,0001,003,0002,113,536
4Sep 14, 2026 00:2252,798448,345,119437,222,0001,003,0002,113,536
5Sep 14, 2026 00:2252,810448,671,421437,324,0001,005,0002,113,536
6Sep 14, 2026 00:2252,820448,622,275437,402,0001,005,0002,113,536
7Sep 14, 2026 00:2252,823448,666,661437,427,0001,005,0002,113,536
8Sep 14, 2026 00:2252,823448,620,834437,435,0001,004,0002,113,536
9Sep 14, 2026 00:2252,851448,775,802437,667,0001,004,0002,113,536