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 listJul 6, 2026 04:56Teow Hua JunTeow Hua JunScore: 12,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 04:5712,088109,964,20390,823,0009,513,0002,113,536
2Jul 6, 2026 04:5712,112110,181,62090,503,00010,029,0002,113,536
3Jul 6, 2026 04:5712,215111,014,59190,846,00010,542,0002,113,536
4Jul 6, 2026 04:5712,253111,387,34891,547,00010,156,0002,113,536
5Jul 6, 2026 04:5712,391112,897,20991,219,00011,629,0002,113,536
6Jul 6, 2026 04:5712,404112,959,49393,138,0009,823,0002,113,536
7Jul 6, 2026 04:5712,490113,690,80693,957,0009,710,0002,113,536
8Jul 6, 2026 04:5712,513113,673,46693,742,00010,124,0002,113,536
9Jul 6, 2026 04:5712,632114,913,70595,048,0009,800,0002,113,536