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 listJun 21, 2025 22:02Valentin KofmanValentin KofmanScore: 55,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 22:0255,536487,176,496458,951,0001,999,0002,273,280
2Jun 21, 2025 22:0255,541486,841,399458,995,0001,999,0002,392,064
3Jun 21, 2025 22:0255,618486,532,589460,634,000999,0002,404,352
4Jun 21, 2025 22:0255,633489,016,948459,757,0001,998,0002,273,280
5Jun 21, 2025 22:0255,648484,785,341460,883,000999,0002,273,280
6Jun 21, 2025 22:0255,664491,660,358460,010,0002,000,0002,273,280
7Jun 21, 2025 22:0255,669489,638,679461,051,0001,000,0002,273,280
8Jun 21, 2025 22:0255,678487,420,379461,131,0001,000,0002,273,280
9Jun 21, 2025 22:0255,797492,127,413463,116,00002,396,160