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 10:26wnwnScore: 3,485Success
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 10:263,39743,665,00927,142,0001,055,0002,498,560
2May 10, 2026 10:263,39746,917,68027,148,0001,051,0002,478,080
3May 10, 2026 10:263,39942,238,69127,166,0001,049,0002,486,272
4May 10, 2026 10:263,43644,397,73127,356,0001,168,0002,482,176
5May 10, 2026 10:263,48542,692,43627,861,0001,067,0002,490,368
6May 10, 2026 10:263,54445,104,99328,353,0001,068,0002,486,272
7May 10, 2026 10:263,54546,720,71428,333,0001,096,0002,490,368
8May 10, 2026 10:263,58344,477,56128,696,0001,043,0002,490,368
9May 10, 2026 10:263,59446,231,31828,757,0001,078,0002,490,368