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 7, 2026 03:44Victor MerckléVictor MerckléScore: 4,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:454,71247,102,33438,020,0001,096,0002,117,632stderr
2Jul 7, 2026 03:454,72347,323,00538,067,0001,135,0002,117,632stderr
3Jul 7, 2026 03:454,72747,248,48038,139,0001,098,0002,117,632stderr
4Jul 7, 2026 03:454,73947,402,44738,161,0001,175,0002,117,632stderr
5Jul 7, 2026 03:454,74047,259,04338,236,0001,106,0002,117,632stderr
6Jul 7, 2026 03:454,75547,516,76138,296,0001,172,0002,117,632stderr
7Jul 7, 2026 03:454,75647,405,89438,395,0001,085,0002,117,632stderr
8Jul 7, 2026 03:454,76047,608,43638,323,0001,187,0002,117,632stderr
9Jul 7, 2026 03:454,76247,443,10638,303,0001,227,0002,117,632stderr