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:47Josu San MartinJosu San MartinScore: 4,209Success
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:484,19243,222,43233,771,0001,027,0002,113,536
2May 10, 2026 13:484,19445,144,28233,781,0001,030,0002,113,536
3May 10, 2026 13:484,19645,209,29133,800,0001,027,0002,113,536
4May 10, 2026 13:484,19743,864,90233,810,0001,032,0002,113,536
5May 10, 2026 13:484,20944,283,19933,807,0001,129,0002,113,536
6May 10, 2026 13:484,21342,777,00433,827,0001,145,0002,113,536
7May 10, 2026 13:484,21744,236,38733,956,0001,046,0002,113,536
8May 10, 2026 13:484,24145,792,57834,163,0001,043,0002,113,536
9May 10, 2026 13:484,31045,333,61334,720,0001,059,0002,113,536