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 listJan 23, 2025 07:28Ian MckibbenIan MckibbenScore: 31,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 07:2831,054287,229,546257,750,00002,433,024
2Jan 23, 2025 07:2831,059280,687,374257,790,00002,531,328
3Jan 23, 2025 07:2831,062287,762,982256,814,000999,0002,531,328
4Jan 23, 2025 07:2831,080282,486,014255,968,0001,999,0002,433,024
5Jan 23, 2025 07:2831,080281,880,271255,964,0001,999,0002,428,928
6Jan 23, 2025 07:2831,080283,305,071256,965,000999,0002,433,024
7Jan 23, 2025 07:2831,083281,111,985255,992,0001,999,0002,433,024
8Jan 23, 2025 07:2831,084288,713,919256,000,0002,000,0002,437,120
9Jan 23, 2025 07:2831,105283,198,685257,172,0001,000,0002,433,024