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 10, 2026 13:14wnwnScore: 3,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:143,39138,062,45528,153,00002,113,536
2May 10, 2026 13:143,39936,776,89328,213,00002,113,536
3May 10, 2026 13:143,40438,852,99628,259,00002,113,536
4May 10, 2026 13:143,41535,887,95928,349,00002,113,536
5May 10, 2026 13:143,41536,635,14128,352,00002,113,536
6May 10, 2026 13:143,43439,092,25528,505,00002,113,536
7May 10, 2026 13:143,43638,981,69628,525,00002,113,536
8May 10, 2026 13:143,46637,734,88028,768,00002,113,536
9May 10, 2026 13:143,52747,559,43228,263,0001,014,0002,113,536