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 25, 2026 03:09Victor MerckléVictor MerckléScore: 9,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 03:098,77280,995,18471,784,0001,029,0002,117,632stderr
2Aug 25, 2026 03:098,95882,475,27673,334,0001,018,0002,117,632stderr
3Aug 25, 2026 03:099,00983,063,39773,647,0001,128,0002,117,632stderr
4Aug 25, 2026 03:099,02283,223,74873,871,0001,016,0002,117,632stderr
5Aug 25, 2026 03:099,02883,320,78773,925,0001,015,0002,117,632stderr
6Aug 25, 2026 03:099,03484,127,91773,980,0001,005,0002,117,632stderr
7Aug 25, 2026 03:099,03483,337,15073,968,0001,018,0002,117,632stderr
8Aug 25, 2026 03:099,04483,410,37974,065,0001,003,0002,117,632stderr
9Aug 25, 2026 03:099,05083,232,29073,976,0001,143,0002,117,632stderr