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 8, 2026 11:34Victor MerckléVictor MerckléScore: 5,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 11:394,65147,108,82233,468,0005,142,0002,117,632stderr
2Sep 8, 2026 11:394,71848,339,44934,316,0004,849,00024,576stderr
3Sep 8, 2026 11:394,74547,847,76734,216,0005,173,0002,117,632stderr
4Sep 8, 2026 11:394,75648,603,36734,316,0005,161,0002,117,632stderr
5Sep 8, 2026 11:395,00050,659,57534,401,0007,104,0002,117,632stderr
6Sep 8, 2026 11:395,00149,982,02334,411,0007,099,0002,117,632stderr
7Sep 8, 2026 11:395,00950,127,44634,206,0007,370,0002,117,632stderr
8Sep 8, 2026 11:395,02350,802,04234,560,0007,138,0002,117,632stderr
9Sep 8, 2026 11:395,03150,277,40734,325,0007,440,00024,576stderr