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 listMar 28, 2026 00:16Ondřej PolaneckýOndřej PolaneckýScore: 9,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 00:169,607109,551,71377,743,0001,993,0002,285,568
2Mar 28, 2026 00:169,624103,115,00478,878,000998,0002,277,376
3Mar 28, 2026 00:169,771102,521,49979,095,0002,002,0002,293,760