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 10, 2026 08:41Josu San MartinJosu San MartinScore: 4,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:414,06647,015,49932,651,0001,099,0002,482,176
2May 10, 2026 08:414,07046,322,65732,643,0001,146,0002,482,176
3May 10, 2026 08:414,07850,337,74132,696,0001,157,0002,482,176
4May 10, 2026 08:414,08346,206,69632,751,0001,145,0002,486,272
5May 10, 2026 08:414,08748,528,85232,757,0001,172,0002,478,080
6May 10, 2026 08:414,09350,136,12932,945,0001,029,0002,490,368
7May 10, 2026 08:414,09652,616,17132,931,0001,067,0002,482,176
8May 10, 2026 08:414,09849,536,36132,918,0001,101,0002,486,272
9May 10, 2026 08:414,11348,866,12332,961,0001,178,0002,486,272