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 9, 2026 20:49Josu San MartinJosu San MartinScore: 4,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 20:494,82856,380,49638,875,0001,201,0002,359,296
2May 9, 2026 20:494,83456,341,93639,086,0001,043,0002,355,200
3May 9, 2026 20:494,86057,704,51439,312,0001,026,0002,347,008
4May 9, 2026 20:494,86456,855,51039,344,0001,034,0002,342,912
5May 9, 2026 20:494,87056,766,89739,397,0001,032,0002,342,912
6May 9, 2026 20:494,93955,436,98239,960,0001,039,0002,351,104
7May 9, 2026 20:494,96459,445,57240,178,0001,028,0002,342,912
8May 9, 2026 20:495,00456,549,68740,515,0001,023,0002,347,008
9May 9, 2026 20:495,15158,079,59341,730,0001,026,0002,338,816