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:30Josu San MartinJosu San MartinScore: 3,979Success
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:343,94440,058,43931,678,0001,063,0002,113,536
2May 10, 2026 18:343,94942,914,63531,749,0001,035,0002,113,536
3May 10, 2026 18:343,95640,656,91231,762,0001,079,0002,113,536
4May 10, 2026 18:343,96240,958,55031,821,0001,069,0002,113,536
5May 10, 2026 18:343,97943,158,10331,961,0001,070,0002,113,536
6May 10, 2026 18:343,98642,630,45232,019,0001,070,0002,113,536
7May 10, 2026 18:343,99341,864,15632,130,0001,019,0002,113,536
8May 10, 2026 18:344,03443,622,88432,449,0001,036,0002,113,536
9May 10, 2026 18:344,14543,686,38033,366,0001,039,0002,113,536