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 listJul 9, 2026 06:13Victor MerckléVictor MerckléScore: 4,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 06:144,06541,789,01432,636,0001,106,0002,117,632stderr
2Jul 9, 2026 06:144,07741,888,00632,748,0001,096,0002,117,632stderr
3Jul 9, 2026 06:144,08642,034,13532,807,0001,112,0002,117,632stderr
4Jul 9, 2026 06:144,09242,059,42532,863,0001,107,0002,117,632stderr
5Jul 9, 2026 06:144,10042,147,35732,921,0001,110,0002,117,632stderr
6Jul 9, 2026 06:144,12942,328,57533,241,0001,030,0002,117,632stderr
7Jul 9, 2026 06:144,18642,848,12333,650,0001,100,0002,117,632stderr
8Jul 9, 2026 06:144,19344,150,62833,783,0001,025,0002,117,632stderr
9Jul 9, 2026 06:144,21243,051,74933,937,0001,025,0002,117,632stderr