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 listApr 12, 2026 19:24Josu San MartinJosu San MartinScore: 5,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 19:245,04065,833,12439,838,0001,991,0002,285,568
2Apr 12, 2026 19:245,07063,182,87040,075,0002,003,0002,285,568
3Apr 12, 2026 19:245,10566,405,55141,361,0001,008,0002,404,352
4Apr 12, 2026 19:245,23864,907,09642,466,0001,011,0002,285,568
5Apr 12, 2026 19:245,25267,778,91442,581,0001,013,0002,285,568
6Apr 12, 2026 19:245,28768,710,01941,892,0001,994,0002,404,352