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 listAug 6, 2026 00:49TonyTonyScore: 7,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 00:497,70873,803,90861,317,0002,664,0002,113,536
2Aug 6, 2026 00:497,71273,779,37661,344,0002,670,0002,113,536
3Aug 6, 2026 00:497,72473,896,87461,444,0002,669,0002,113,536
4Aug 6, 2026 00:497,72573,951,66661,446,0002,673,0002,113,536
5Aug 6, 2026 00:497,72573,954,13561,473,0002,652,0002,113,536
6Aug 6, 2026 00:497,74674,135,88461,697,0002,603,0002,113,536
7Aug 6, 2026 00:497,75174,204,94862,268,0002,072,0002,113,536
8Aug 6, 2026 00:497,77074,399,43461,825,0002,671,0002,113,536
9Aug 6, 2026 00:497,83474,767,76562,351,0002,674,0002,113,536