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 listAug 28, 2026 05:20Victor MerckléVictor MerckléScore: 3,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:213,70839,167,17429,626,0001,157,0002,113,536
2Aug 28, 2026 05:213,71539,134,31129,688,0001,150,0002,113,536
3Aug 28, 2026 05:213,72139,212,58429,798,0001,093,0002,113,536
4Aug 28, 2026 05:213,73539,352,85129,814,0001,193,0002,113,536
5Aug 28, 2026 05:213,73739,361,93129,950,0001,070,0002,113,536
6Aug 28, 2026 05:213,75940,308,47530,041,0001,163,0002,113,536
7Aug 28, 2026 05:213,80539,941,30130,451,0001,134,0002,113,536
8Aug 28, 2026 05:213,83340,129,45930,745,0001,077,0002,113,536
9Aug 28, 2026 05:213,94241,047,63431,656,0001,063,0002,113,536