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 11, 2026 21:30Victor MerckléVictor MerckléScore: 4,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 21:313,99141,581,09131,959,0001,169,0002,117,632stderr
2Aug 11, 2026 21:313,99941,418,99832,029,0001,167,0002,117,632stderr
3Aug 11, 2026 21:314,00341,589,01932,102,0001,129,0002,117,632stderr
4Aug 11, 2026 21:314,01842,928,44032,320,0001,035,0002,117,632stderr
5Aug 11, 2026 21:314,02741,837,23732,398,0001,028,0002,117,632stderr
6Aug 11, 2026 21:314,03442,249,97332,453,0001,033,0002,117,632stderr
7Aug 11, 2026 21:314,05642,067,36632,535,0001,136,0002,117,632stderr
8Aug 11, 2026 21:314,05741,822,13032,520,0001,155,0002,117,632stderr
9Aug 11, 2026 21:314,10542,492,28832,947,0001,127,0002,117,632stderr