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 5, 2026 15:30Kevin HeaveyKevin HeaveyScore: 12,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 15:3111,854107,936,25295,337,0003,054,0002,117,632
2Jul 5, 2026 15:3111,884108,194,39095,626,0003,012,0002,117,632
3Jul 5, 2026 15:3111,904108,299,47095,782,0003,023,0002,117,632
4Jul 5, 2026 15:3111,961108,779,52296,246,0003,034,0002,117,632
5Jul 5, 2026 15:3112,001109,586,18496,572,0003,040,0002,117,632
6Jul 5, 2026 15:3112,026109,407,77596,792,0003,030,0002,117,632
7Jul 5, 2026 15:3112,118110,044,59697,457,0003,127,0002,117,632
8Jul 5, 2026 15:3112,119110,137,91797,391,0003,199,0002,117,632
9Jul 5, 2026 15:3112,288112,688,00198,659,0003,339,0002,117,632