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:13Josu San MartinJosu San MartinScore: 7,052Success
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:136,84466,140,18654,743,0002,065,0002,113,536
2Jul 4, 2026 00:136,87466,488,05755,007,0002,048,0002,113,536
3Jul 4, 2026 00:136,93966,910,63055,526,0002,069,0002,113,536
4Jul 4, 2026 00:137,00267,486,33955,094,0003,026,0002,113,536
5Jul 4, 2026 00:137,05267,844,31656,470,0002,067,0002,113,536
6Jul 4, 2026 00:137,13568,590,63557,184,0002,038,0002,113,536
7Jul 4, 2026 00:137,82274,183,19662,887,0002,040,0002,113,536
8Jul 4, 2026 00:137,83074,372,35662,954,0002,040,0002,113,536
9Jul 4, 2026 00:138,10976,707,69064,291,0003,021,0002,113,536