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 listAug 22, 2026 08:50wnwnScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2026 08:513,31635,652,04626,518,0001,010,0002,113,536
2Aug 22, 2026 08:513,38536,484,87527,065,0001,038,0002,113,536
3Aug 22, 2026 08:513,42236,790,89627,377,0001,033,0002,113,536
4Aug 22, 2026 08:513,42636,771,87627,437,0001,006,0002,113,536
5Aug 22, 2026 08:513,46637,797,54427,739,0001,034,0002,113,536
6Aug 22, 2026 08:513,47538,024,54727,839,0001,005,0002,113,536
7Aug 22, 2026 08:513,47737,955,48327,855,0001,008,0002,113,536
8Aug 22, 2026 08:513,51137,293,85428,135,0001,014,0002,113,536
9Aug 22, 2026 08:513,52638,218,17928,231,0001,035,0002,113,536