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 23, 2025 19:24Valentin KofmanValentin KofmanScore: 9,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 19:249,974111,901,51381,791,000997,0002,289,664
2Jun 23, 2025 19:249,976108,893,27782,801,00002,265,088
3Jun 23, 2025 19:249,979107,848,16980,831,0001,995,0002,367,488
4Jun 23, 2025 19:249,987112,879,77380,899,0001,997,0002,289,664
5Jun 23, 2025 19:249,989103,465,45380,913,0001,997,0002,265,088
6Jun 23, 2025 19:249,990109,915,91181,909,0001,011,0002,289,664
7Jun 23, 2025 19:249,991107,078,51280,929,0001,998,0002,289,664
8Jun 23, 2025 19:249,995111,149,25081,956,000999,0002,289,664
9Jun 23, 2025 19:249,995110,135,78281,962,000999,0002,289,664
10Jun 23, 2025 19:2410,001110,485,51881,009,0002,000,0002,289,664
11Jun 23, 2025 19:2410,002108,442,51081,018,0002,000,0002,289,664
12Jun 23, 2025 19:2410,004108,996,44181,030,0002,000,0002,273,280