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 19, 2026 04:50Josu San MartinJosu San MartinScore: 6,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 04:505,95870,902,92348,445,0001,009,0002,404,352
2Feb 19, 2026 04:506,06475,286,17350,332,00002,281,472
3Feb 19, 2026 04:506,08272,061,70450,477,00002,392,064
4Feb 19, 2026 04:506,12177,797,13850,804,00002,269,184
5Feb 19, 2026 04:506,21979,019,39549,629,0001,985,0002,400,256
6Feb 19, 2026 04:506,26073,671,52150,958,000999,0002,404,352