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 listMay 31, 2025 00:58Andrew AshworthAndrew AshworthScore: 110,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 00:58110,847945,142,129919,027,0001,000,0002,285,568
2May 31, 2025 00:58110,848944,653,928920,041,00002,285,568
3May 31, 2025 00:58110,854945,454,835919,091,0001,000,0002,273,280
4May 31, 2025 00:58110,856945,500,330919,103,0001,000,0002,265,088
5May 31, 2025 00:58110,857941,141,201919,112,0001,000,0002,260,992
6May 31, 2025 00:58110,866949,179,691919,187,0001,000,0002,285,568
7May 31, 2025 00:58110,876947,834,316919,275,000999,0002,285,568
8May 31, 2025 00:58110,888945,925,079918,370,0001,998,0002,285,568
9May 31, 2025 00:58110,897945,391,788918,446,0001,998,0002,265,088