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 listJul 3, 2026 20:02Josu San MartinJosu San MartinScore: 6,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:026,87166,455,93455,010,0002,020,0002,113,536
2Jul 3, 2026 20:026,87666,398,45155,053,0002,026,0002,113,536
3Jul 3, 2026 20:026,88366,743,40855,130,0002,001,0002,113,536
4Jul 3, 2026 20:026,88566,554,67756,124,0001,022,0002,113,536
5Jul 3, 2026 20:026,89666,608,81755,233,0002,007,0002,113,536
6Jul 3, 2026 20:026,89866,654,38455,245,0002,014,0002,113,536
7Jul 3, 2026 20:026,90866,742,67255,290,0002,047,0002,113,536
8Jul 3, 2026 20:026,91166,784,24155,326,0002,038,0002,113,536
9Jul 3, 2026 20:026,93166,889,32655,495,0002,035,0002,113,536