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 19:18Josu San MartinJosu San MartinScore: 4,920Success
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 19:204,78756,492,38538,695,0001,040,0002,347,008
2May 9, 2026 19:204,81154,808,34738,632,0001,303,0002,342,912
3May 9, 2026 19:204,87555,313,62539,177,0001,287,0002,351,104
4May 9, 2026 19:204,87758,752,75339,432,0001,054,0002,342,912
5May 9, 2026 19:204,92055,535,77339,629,0001,213,0002,351,104
6May 9, 2026 19:204,92057,301,20839,546,0001,297,0002,351,104
7May 9, 2026 19:204,93456,021,86339,739,0001,217,0002,355,200
8May 9, 2026 19:204,95657,944,88339,840,0001,299,0002,338,816
9May 9, 2026 19:204,96257,646,33439,901,0001,291,0002,347,008