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 18, 2026 07:40wnwnScore: 9,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 07:409,647106,581,41378,072,0002,001,0002,277,376
2Apr 18, 2026 07:409,667103,183,43679,237,0001,003,0002,277,376
3Apr 18, 2026 07:409,745105,934,21678,883,0001,997,0002,277,376