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 18, 2026 10:34boop34boop34Score: 9,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 10:359,31487,069,99976,302,0001,012,0002,113,536
2Jul 18, 2026 10:359,31887,100,08076,319,0001,027,0002,113,536
3Jul 18, 2026 10:359,33387,184,01876,457,0001,008,0002,113,536
4Jul 18, 2026 10:359,36187,360,07976,640,0001,063,0002,113,536
5Jul 18, 2026 10:359,36487,466,14876,718,0001,010,0002,113,536
6Jul 18, 2026 10:359,36587,737,87776,607,0001,125,0002,113,536
7Jul 18, 2026 10:359,36687,492,10976,710,0001,028,0002,113,536
8Jul 18, 2026 10:359,42287,906,64777,180,0001,023,0002,113,536
9Jul 18, 2026 10:359,46689,014,03277,465,0001,111,0002,113,536