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 listMay 11, 2026 01:53Josu San MartinJosu San MartinScore: 3,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:533,85842,472,07130,942,0001,083,0002,113,536
2May 11, 2026 01:533,86739,933,28631,034,0001,068,0002,113,536
3May 11, 2026 01:533,87040,148,63431,056,0001,067,0002,113,536
4May 11, 2026 01:533,87439,815,72431,070,0001,086,0002,113,536
5May 11, 2026 01:533,87639,871,09631,042,0001,131,0002,113,536
6May 11, 2026 01:533,88740,302,71831,185,0001,079,0002,113,536
7May 11, 2026 01:533,90240,073,76831,317,0001,070,0002,113,536
8May 11, 2026 01:533,90541,826,65431,341,0001,075,0002,113,536
9May 11, 2026 01:533,90642,194,91431,336,0001,092,0002,113,536