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 14, 2026 18:20marko1597marko1597Score: 6,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:236,21961,599,51650,479,0001,145,0002,117,632stderr
2Aug 14, 2026 18:236,22361,675,26250,515,0001,142,0002,117,632stderr
3Aug 14, 2026 18:236,22561,754,01250,525,0001,148,0002,117,632stderr
4Aug 14, 2026 18:236,23961,781,27050,612,0001,173,0002,117,632stderr
5Aug 14, 2026 18:236,24361,809,55350,680,0001,143,0002,117,632stderr
6Aug 14, 2026 18:236,32963,272,79051,372,0001,165,0002,117,632stderr
7Aug 14, 2026 18:236,35463,505,91151,571,0001,170,0002,117,632stderr
8Aug 14, 2026 18:236,35862,725,96951,562,0001,211,0002,117,632stderr
9Aug 14, 2026 18:236,50464,009,57152,913,0001,074,0002,117,632stderr