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 listFeb 24, 2026 20:19Daniel MastalerzDaniel MastalerzScore: 5,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:195,39173,365,77941,762,0002,983,0002,289,664
2Feb 24, 2026 20:195,39774,756,60541,811,0002,986,0002,371,584
3Feb 24, 2026 20:195,40572,261,02341,869,0002,990,0002,265,088
4Feb 24, 2026 20:195,48079,066,15742,449,0003,032,0002,265,088
5Feb 24, 2026 20:195,48369,380,43642,477,0003,034,0002,514,944
6Feb 24, 2026 20:195,51773,218,54342,806,0002,986,0002,273,280