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 29, 2025 05:25Josu San MartinJosu San MartinScore: 31,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 05:2731,176280,723,993257,755,0001,002,0002,408,448
2Dec 29, 2025 05:2531,179280,972,093257,790,000999,0002,387,968
3Dec 29, 2025 05:2731,179286,730,667257,787,000999,0002,273,280
4Dec 29, 2025 05:2731,181283,736,095257,803,000999,0002,273,280
5Dec 29, 2025 05:2731,189280,363,648257,872,000999,0002,392,064
6Dec 29, 2025 05:2731,195294,561,032256,922,0001,999,0002,404,352
7Dec 29, 2025 05:2731,195282,396,485257,923,000999,0002,396,160
8Dec 29, 2025 05:2531,196282,030,002256,926,0001,999,0002,396,160
9Dec 29, 2025 05:2531,199281,739,270256,953,0001,999,0002,273,280
10Dec 29, 2025 05:2731,206287,308,494258,007,0001,000,0002,273,280
11Dec 29, 2025 05:2731,206281,632,924257,009,0002,000,0002,273,280
12Dec 29, 2025 05:2731,217282,138,133258,102,0001,000,0002,396,160