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:08Josu San MartinJosu San MartinScore: 4,969Success
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:084,88056,216,94339,474,0001,032,0002,527,232
2May 9, 2026 20:084,88154,752,73239,470,0001,043,0002,510,848
3May 9, 2026 20:084,90357,988,24439,651,0001,050,0002,502,656
4May 9, 2026 20:084,95255,169,64240,072,0001,031,0002,510,848
5May 9, 2026 20:084,96958,366,26740,214,0001,032,0002,510,848
6May 9, 2026 20:084,98456,368,83140,313,0001,058,0002,510,848
7May 9, 2026 20:084,99455,692,19740,427,0001,029,0002,510,848
8May 9, 2026 20:085,12559,302,66941,512,0001,028,0002,498,560
9May 9, 2026 20:085,19359,037,75942,068,0001,041,0002,514,944