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 listDec 5, 2025 09:03warshipwarshipScore: 67,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 09:0367,498584,945,841559,231,0001,000,0002,277,376
2Dec 5, 2025 09:0367,537593,009,080558,561,0001,998,0002,285,568
3Dec 5, 2025 09:0367,539586,760,913559,574,000999,0002,519,040
4Dec 5, 2025 09:0367,543584,707,285558,607,0001,998,0002,510,848
5Dec 5, 2025 09:0367,552591,689,587558,680,0001,998,0002,285,568
6Dec 5, 2025 09:0367,577584,678,549558,886,0001,999,0002,285,568
7Dec 5, 2025 09:0367,661592,672,472559,589,0001,998,0002,277,376
8Dec 5, 2025 09:0367,670586,487,774560,660,000999,0002,260,992
9Dec 5, 2025 09:0367,696582,932,122559,880,0001,999,0002,265,088