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 18:46Josu San MartinJosu San MartinScore: 3,872Success
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 18:463,85140,036,05630,893,0001,073,0002,113,536
2May 10, 2026 18:463,85742,188,13330,943,0001,073,0002,113,536
3May 10, 2026 18:463,86642,733,12930,999,0001,092,0002,113,536
4May 10, 2026 18:463,86839,576,18731,027,0001,085,0002,113,536
5May 10, 2026 18:463,87240,081,59631,059,0001,086,0002,113,536
6May 10, 2026 18:463,87939,844,40631,098,0001,099,0002,113,536
7May 10, 2026 18:463,89042,638,97331,226,0001,064,0002,113,536
8May 10, 2026 18:463,89640,318,26431,269,0001,072,0002,113,536
9May 10, 2026 18:463,93041,875,21631,556,0001,065,0002,113,536