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 listMar 29, 2026 20:01Danylo MocherniukDanylo MocherniukScore: 8,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 20:018,00792,308,45565,451,0001,006,0002,293,760
2Mar 29, 2026 20:018,00893,553,69365,462,0001,007,0002,293,760
3Mar 29, 2026 20:018,03196,117,55065,646,0001,009,0002,293,760
4Mar 29, 2026 20:018,03693,919,59865,691,0001,010,0002,293,760
5Mar 29, 2026 20:018,04793,032,69765,793,000996,0002,502,656
6Mar 29, 2026 20:018,05494,527,44564,853,0001,995,0002,293,760
7Mar 29, 2026 20:018,05492,097,72464,854,0001,995,0002,342,912
8Mar 29, 2026 20:018,05694,319,91664,866,0001,995,0002,293,760
9Mar 29, 2026 20:018,06689,740,46063,950,0002,997,0002,293,760