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 14, 2026 23:24Andrew TsibinAndrew TsibinScore: 5,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:245,43354,801,42244,088,0001,009,0002,113,536
2Jul 14, 2026 23:245,43954,740,19544,142,0001,008,0002,113,536
3Jul 14, 2026 23:245,44954,761,60444,221,0001,009,0002,113,536
4Jul 14, 2026 23:245,47655,037,43044,435,0001,017,0002,113,536
5Jul 14, 2026 23:245,48255,056,34944,495,0001,008,0002,113,536
6Jul 14, 2026 23:245,48855,132,44344,532,0001,022,0002,113,536
7Jul 14, 2026 23:245,53055,493,05344,896,0001,007,0002,113,536
8Jul 14, 2026 23:245,53455,614,07544,875,0001,058,0002,113,536
9Jul 14, 2026 23:245,54455,597,25844,857,0001,159,0002,113,536