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 25, 2026 19:48Maya RebholzMaya RebholzScore: 6,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 19:486,04563,154,50144,667,0005,513,0002,113,536
2May 25, 2026 19:486,08060,427,09244,895,0005,570,0002,113,536
3May 25, 2026 19:486,08661,909,55944,998,0005,518,0002,117,632
4May 25, 2026 19:486,15163,751,55645,553,0005,508,0002,117,632
5May 25, 2026 19:486,17262,769,51245,771,0005,462,0002,113,536
6May 25, 2026 19:486,18562,997,96845,662,0005,675,0002,117,632
7May 25, 2026 19:486,18663,144,09445,908,0005,443,0002,113,536
8May 25, 2026 19:486,25463,836,95546,209,0005,704,0002,117,632
9May 25, 2026 19:486,47063,709,35348,070,0005,631,0002,113,536