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 23, 2026 18:06Victor MerckléVictor MerckléScore: 3,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:073,74139,453,30429,879,0001,172,0002,117,632stderr
2Aug 23, 2026 18:073,77739,737,52630,203,0001,148,0002,117,632stderr
3Aug 23, 2026 18:073,78039,823,43130,271,0001,103,0002,117,632stderr
4Aug 23, 2026 18:073,78239,769,27630,275,0001,121,0002,117,632stderr
5Aug 23, 2026 18:073,81840,091,70030,557,0001,134,0002,117,632stderr
6Aug 23, 2026 18:073,82140,053,23130,603,0001,117,0002,117,632stderr
7Aug 23, 2026 18:073,88640,637,36231,131,0001,124,0002,117,632stderr
8Aug 23, 2026 18:073,99341,546,54332,132,0001,016,0002,117,632stderr
9Aug 23, 2026 18:074,02742,492,60632,352,0001,079,0002,117,632stderr