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 listSep 12, 2025 10:47Aleksei ShahoikaAleksei ShahoikaScore: 29,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2025 10:4729,580276,519,365244,512,0001,002,0002,285,568
2Sep 12, 2025 10:4729,602272,219,144243,696,0001,997,0002,285,568
3Sep 12, 2025 10:4729,603272,504,752244,703,000998,0002,277,376
4Sep 12, 2025 10:4729,616271,873,438244,812,000999,0002,285,568
5Sep 12, 2025 10:4729,617270,621,066243,819,0001,998,0002,285,568
6Sep 12, 2025 10:4729,617268,877,537244,824,000999,0002,285,568
7Sep 12, 2025 10:4729,631274,208,013243,941,0001,999,0002,289,664
8Sep 12, 2025 10:4729,681268,290,457245,348,0001,001,0002,285,568
9Sep 12, 2025 10:4733,267300,467,465274,117,0002,000,0002,285,568