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 listOct 17, 2026 12:45timothygktimothygkScore: 40,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 12:4640,533347,412,341335,425,0001,002,0002,117,632stderr
2Oct 17, 2026 12:4640,540348,041,628335,396,0001,094,0002,117,632stderr
3Oct 17, 2026 12:4640,541347,354,936335,411,0001,080,0002,117,632stderr
4Oct 17, 2026 12:4640,548348,053,786335,454,0001,099,0002,117,632stderr
5Oct 17, 2026 12:4640,550348,278,849335,465,0001,107,0002,117,632stderr
6Oct 17, 2026 12:4640,595348,466,619335,936,0001,007,0002,117,632stderr
7Oct 17, 2026 12:4640,631348,693,451336,140,0001,098,0002,117,632stderr
8Oct 17, 2026 12:4641,020351,584,923339,361,0001,108,0002,117,632stderr
9Oct 17, 2026 12:4641,499355,492,235343,426,0001,019,0002,117,632stderr