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 23, 2026 20:18Victor MerckléVictor MerckléScore: 3,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 20:193,74539,408,21929,949,0001,138,0002,117,632stderr
2Aug 23, 2026 20:193,75840,636,68029,976,0001,218,0002,117,632stderr
3Aug 23, 2026 20:193,76039,602,38330,059,0001,149,0002,117,632stderr
4Aug 23, 2026 20:193,76039,587,75430,062,0001,148,0002,117,632stderr
5Aug 23, 2026 20:193,77439,736,05530,212,0001,120,0002,117,632stderr
6Aug 23, 2026 20:193,78639,834,49330,338,0001,090,0002,117,632stderr
7Aug 23, 2026 20:193,80539,864,05130,527,0001,062,0002,117,632stderr
8Aug 23, 2026 20:193,81940,078,76230,483,0001,217,0002,117,632stderr
9Aug 23, 2026 20:193,89740,796,02431,276,0001,077,0002,117,632stderr