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 4, 2026 00:00Josu San MartinJosu San MartinScore: 7,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:007,04167,798,93049,729,0008,712,0002,113,536
2Jul 4, 2026 00:007,04768,031,03449,786,0008,712,0002,113,536
3Jul 4, 2026 00:007,05567,880,37649,873,0008,690,0002,113,536
4Jul 4, 2026 00:007,06267,988,05249,871,0008,747,0002,113,536
5Jul 4, 2026 00:007,15568,712,55950,933,0008,456,0002,113,536
6Jul 4, 2026 00:007,21478,158,45151,112,0008,770,0002,113,536
7Jul 4, 2026 00:007,21569,232,21751,273,0008,613,0002,113,536
8Jul 4, 2026 00:007,27169,691,77751,645,0008,711,0002,113,536
9Jul 4, 2026 00:007,34970,298,50251,536,0009,461,0002,113,536