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 11:22Victor MerckléVictor MerckléScore: 3,768Success
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 11:243,74012,051,367,14929,881,0001,168,0002,117,632stderr
2Aug 25, 2026 11:243,74312,051,614,29129,924,0001,149,0002,117,632stderr
3Aug 25, 2026 11:243,76512,051,137,01330,087,0001,167,0002,117,632stderr
4Aug 25, 2026 11:243,76512,051,525,73530,095,0001,159,0002,117,632stderr
5Aug 25, 2026 11:243,76812,051,451,76030,163,0001,112,0002,117,632stderr
6Aug 25, 2026 11:243,77612,051,583,00530,236,0001,105,0002,117,632stderr
7Aug 25, 2026 11:243,77712,051,389,87330,183,0001,167,0002,117,632stderr
8Aug 25, 2026 11:243,79612,051,165,54130,368,0001,141,0002,117,632stderr
9Aug 25, 2026 11:243,82012,051,633,05930,549,0001,160,0002,117,632stderr