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 listSep 5, 2026 22:55Kevin HeaveyKevin HeaveyScore: 5,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 22:565,16952,805,92441,887,0001,020,0002,113,536
2Sep 5, 2026 22:565,19154,347,02642,070,0001,019,0002,113,536
3Sep 5, 2026 22:565,21253,113,30842,244,0001,019,0002,113,536
4Sep 5, 2026 22:565,25653,445,75642,600,0001,031,0002,113,536
5Sep 5, 2026 22:565,26053,614,02642,641,0001,021,0002,113,536
6Sep 5, 2026 22:565,26153,551,70042,654,0001,020,0002,113,536
7Sep 5, 2026 22:565,37554,427,27543,598,0001,018,0002,113,536
8Sep 5, 2026 22:565,40355,221,78843,827,0001,019,0002,113,536
9Sep 5, 2026 22:565,45255,125,96944,237,0001,021,0002,113,536