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 27, 2026 10:49Victor MerckléVictor MerckléScore: 4,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 10:514,41744,430,39935,621,0001,042,0002,138,112
2Jun 27, 2026 10:514,41846,625,81435,616,0001,061,0002,138,112
3Jun 27, 2026 10:514,42946,661,30735,710,0001,054,0002,138,112
4Jun 27, 2026 10:514,43246,410,05035,752,0001,036,0002,138,112
5Jun 27, 2026 10:514,43246,033,57935,749,0001,041,0002,138,112
6Jun 27, 2026 10:514,43946,033,44535,812,0001,038,0002,138,112
7Jun 27, 2026 10:514,44046,391,86735,802,0001,054,0002,138,112
8Jun 27, 2026 10:514,44946,653,52935,871,0001,060,0002,138,112
9Jun 27, 2026 10:514,46446,700,24735,984,0001,069,0002,138,112