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 6, 2026 10:58Kevin HeaveyKevin HeaveyScore: 3,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:593,55939,597,73228,396,0001,147,0002,113,536
2Sep 6, 2026 10:593,56539,582,16128,440,0001,156,0002,113,536
3Sep 6, 2026 10:593,60739,954,19828,895,0001,046,0002,113,536
4Sep 6, 2026 10:593,76641,318,62230,113,0001,153,0002,113,536
5Sep 6, 2026 10:593,84241,998,15830,732,0001,161,0002,113,536
6Sep 6, 2026 10:593,86642,108,76630,915,0001,176,0002,113,536
7Sep 6, 2026 10:593,87642,962,39531,030,0001,143,0002,113,536
8Sep 6, 2026 10:593,87743,003,88831,050,0001,136,0002,113,536
9Sep 6, 2026 10:593,88642,260,88331,216,0001,044,0002,113,536