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 listFeb 25, 2026 19:47Daniel MastalerzDaniel MastalerzScore: 6,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 19:476,44978,351,25047,468,0006,059,0002,445,312
2Feb 25, 2026 19:476,48280,699,66145,827,0007,970,0002,449,408
3Feb 25, 2026 19:476,56580,998,03247,429,0007,063,0002,379,776
4Feb 25, 2026 19:476,56577,869,79545,406,0009,081,0002,519,040
5Feb 25, 2026 19:476,58079,481,36045,514,0009,102,0002,461,696
6Feb 25, 2026 19:476,61477,773,59944,916,0009,981,0002,449,408