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 22:03Victor MerckléVictor MerckléScore: 4,639Success
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 22:034,61147,362,80637,120,0001,156,0002,117,632stderr
2Aug 26, 2026 22:034,61146,670,29137,089,0001,185,0002,117,632stderr
3Aug 26, 2026 22:034,63546,786,52537,381,0001,097,0002,117,632stderr
4Aug 26, 2026 22:034,63746,837,72437,405,0001,084,0002,117,632stderr
5Aug 26, 2026 22:034,63946,865,81837,436,0001,068,0002,117,632stderr
6Aug 26, 2026 22:034,64646,916,05737,347,0001,217,0002,117,632stderr
7Aug 26, 2026 22:034,64846,962,26537,482,0001,101,0002,117,632stderr
8Aug 26, 2026 22:034,66347,049,51837,603,0001,102,0002,117,632stderr
9Aug 26, 2026 22:034,66547,103,67637,622,0001,105,0002,117,632stderr