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 6, 2026 07:26Victor MerckléVictor MerckléScore: 7,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:277,79272,666,12563,561,0001,116,0002,117,632stderr
2Jul 6, 2026 07:277,79472,718,96063,567,0001,130,0002,117,632stderr
3Jul 6, 2026 07:277,79872,777,76163,609,0001,120,0002,117,632stderr
4Jul 6, 2026 07:277,80773,779,90063,672,0001,131,0002,117,632stderr
5Jul 6, 2026 07:277,80772,832,56163,669,0001,136,0002,117,632stderr
6Jul 6, 2026 07:277,81572,871,90863,752,0001,114,0002,117,632stderr
7Jul 6, 2026 07:277,81672,881,72163,697,0001,178,0002,117,632stderr
8Jul 6, 2026 07:277,82572,956,66863,785,0001,164,0002,117,632stderr
9Jul 6, 2026 07:277,87173,351,04364,320,0001,013,0002,117,632stderr