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 listApr 29, 2026 23:39olliecrowolliecrowScore: 7,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 23:407,06674,771,50254,607,0004,045,0002,527,232
2Apr 29, 2026 23:407,10378,156,80154,964,0003,997,0002,527,232
3Apr 29, 2026 23:407,14177,681,77556,259,0003,013,0002,449,408
4Apr 29, 2026 23:407,17278,211,79655,494,0004,035,0002,465,792
5Apr 29, 2026 23:407,20980,624,36556,849,0002,992,0002,510,848
6Apr 29, 2026 23:407,23479,935,14557,044,0003,002,0002,510,848
7Apr 29, 2026 23:407,24175,762,15757,097,0003,005,0002,486,272
8Apr 29, 2026 23:407,25073,727,64256,167,0004,011,0002,342,912
9Apr 29, 2026 23:407,28481,906,58855,426,0005,038,0002,510,848