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 26, 2026 12:09Victor MerckléVictor MerckléScore: 4,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:104,25743,147,05534,257,0001,077,0002,113,536
2Jun 26, 2026 12:104,25742,969,74734,248,0001,087,0002,113,536
3Jun 26, 2026 12:104,27143,517,48234,366,0001,088,0002,113,536
4Jun 26, 2026 12:104,27743,185,13534,492,0001,011,0002,113,536
5Jun 26, 2026 12:104,29443,691,46134,562,0001,083,0002,113,536
6Jun 26, 2026 12:104,30643,334,57134,617,0001,126,0002,113,536
7Jun 26, 2026 12:104,41244,193,21835,603,0001,018,0002,113,536
8Jun 26, 2026 12:104,49045,253,88036,193,0001,079,0002,113,536
9Jun 26, 2026 12:104,55245,319,88836,672,0001,115,0002,113,536