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 26, 2026 19:06Victor MerckléVictor MerckléScore: 3,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 19:063,91241,545,61331,332,0001,141,0002,117,632stderr
2Aug 26, 2026 19:063,93941,036,62231,606,0001,089,0002,117,632stderr
3Aug 26, 2026 19:063,94041,102,24931,581,0001,125,0002,117,632stderr
4Aug 26, 2026 19:063,95041,118,54131,717,0001,068,0002,117,632stderr
5Aug 26, 2026 19:063,97442,636,26631,715,0001,275,0002,117,632stderr
6Aug 26, 2026 19:063,97641,087,36331,941,0001,065,0002,117,632stderr
7Aug 26, 2026 19:063,99941,510,27932,056,0001,136,0002,117,632stderr
8Aug 26, 2026 19:064,09042,205,36132,825,0001,126,0002,117,632stderr
9Aug 26, 2026 19:064,18843,879,06133,565,0001,197,0002,117,632stderr