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 11, 2026 13:25wnwnScore: 4,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 13:254,22558,732,34133,061,0002,003,0002,277,376
2Apr 11, 2026 13:254,26356,020,87534,372,0001,010,0002,498,560
3Apr 11, 2026 13:254,31664,187,79433,832,0001,990,0002,273,280