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 listJul 18, 2026 10:58boop34boop34Score: 9,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 10:599,04785,329,28674,074,0001,022,0002,113,536
2Jul 18, 2026 10:599,07784,948,15074,317,0001,024,0002,113,536
3Jul 18, 2026 10:599,08185,071,13174,358,0001,021,0002,113,536
4Jul 18, 2026 10:599,09785,111,50274,488,0001,021,0002,113,536
5Jul 18, 2026 10:599,09885,115,08974,498,0001,020,0002,113,536
6Jul 18, 2026 10:599,11486,470,44974,628,0001,019,0002,113,536
7Jul 18, 2026 10:599,11485,243,12874,630,0001,022,0002,113,536
8Jul 18, 2026 10:599,13785,446,72474,823,0001,022,0002,113,536
9Jul 18, 2026 10:599,34587,180,16076,545,0001,020,0002,113,536