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:15Victor MerckléVictor MerckléScore: 10,960Success
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:1610,89698,778,39585,146,0005,292,0002,117,632stderr
2Aug 11, 2026 21:1610,90598,887,45585,213,0005,306,0002,117,632stderr
3Aug 11, 2026 21:1610,909100,075,86685,033,0005,514,0002,117,632stderr
4Aug 11, 2026 21:1610,93999,172,05385,454,0005,345,0002,117,632stderr
5Aug 11, 2026 21:1610,96099,955,54685,314,0005,655,0002,117,632stderr
6Aug 11, 2026 21:1610,97299,491,70785,408,0005,660,0002,117,632stderr
7Aug 11, 2026 21:1610,97799,510,35785,622,0005,494,0002,117,632stderr
8Aug 11, 2026 21:1611,01899,905,34185,709,0005,746,0002,117,632stderr
9Aug 11, 2026 21:1611,122100,727,22186,978,0005,336,0002,117,632stderr