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 22, 2026 05:09wnwnScore: 3,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 05:113,54047,474,09129,389,00002,490,368
2Apr 22, 2026 05:113,54743,181,97528,429,0001,015,0002,330,624
3Apr 22, 2026 05:113,54946,870,43728,446,0001,015,0002,486,272
4Apr 22, 2026 05:113,55144,998,08628,465,0001,016,0002,494,464
5Apr 22, 2026 05:113,55144,657,14628,463,0001,016,0002,330,624
6Apr 22, 2026 05:113,57544,664,66528,653,0001,023,0002,486,272
7Apr 22, 2026 05:113,63951,150,18929,201,0001,006,0002,482,176
8Apr 22, 2026 05:113,65448,642,66329,320,0001,011,0002,490,368
9Apr 22, 2026 05:113,73547,284,79429,001,0002,000,0002,482,176