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 13:05Victor MerckléVictor MerckléScore: 4,401Success
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 13:064,37543,968,93735,233,0001,085,0002,113,536
2Jun 26, 2026 13:064,37843,990,85035,273,0001,071,0002,113,536
3Jun 26, 2026 13:064,39244,134,75335,373,0001,087,0002,113,536
4Jun 26, 2026 13:064,40044,199,71935,506,0001,016,0002,113,536
5Jun 26, 2026 13:064,40144,220,89935,428,0001,102,0002,113,536
6Jun 26, 2026 13:064,40344,291,58335,431,0001,116,0002,113,536
7Jun 26, 2026 13:064,40744,227,13935,569,0001,017,0002,113,536
8Jun 26, 2026 13:064,41644,352,15835,615,0001,042,0002,113,536
9Jun 26, 2026 13:064,46844,791,44836,079,0001,011,0002,113,536