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 12:25wnwnScore: 3,430Success
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 12:253,37442,144,06426,983,0001,023,0002,490,368
2May 9, 2026 12:253,38042,487,92927,016,0001,045,0002,486,272
3May 9, 2026 12:253,38345,201,89927,017,0001,067,0002,486,272
4May 9, 2026 12:253,38443,061,45627,029,0001,059,0002,486,272
5May 9, 2026 12:253,43046,524,86527,378,0001,093,0002,486,272
6May 9, 2026 12:253,45444,288,14627,606,0001,069,0002,494,464
7May 9, 2026 12:253,54146,592,86528,327,0001,068,0002,490,368
8May 9, 2026 12:253,58042,004,95828,664,0001,052,0002,490,368
9May 9, 2026 12:253,59348,057,91128,687,0001,140,0002,486,272