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 1, 2026 08:18Victor MerckléVictor MerckléScore: 4,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 08:194,14642,223,74133,316,0001,099,0002,117,632stderr
2Jul 1, 2026 08:194,15042,267,84633,341,0001,108,0002,117,632stderr
3Jul 1, 2026 08:194,15943,760,37933,435,0001,087,0002,117,632stderr
4Jul 1, 2026 08:194,16442,294,55633,494,0001,074,0002,117,632stderr
5Jul 1, 2026 08:194,23042,925,91234,100,0001,012,0002,117,632stderr
6Jul 1, 2026 08:194,25343,131,26834,286,0001,019,0002,117,632stderr
7Jul 1, 2026 08:194,26343,122,05534,349,0001,039,0002,117,632stderr
8Jul 1, 2026 08:194,32643,733,36534,775,0001,135,0002,117,632stderr
9Jul 1, 2026 08:194,32943,755,91034,834,0001,102,0002,117,632stderr