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 10, 2026 13:06Victor MerckléVictor MerckléScore: 8,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:078,22375,835,61267,252,0001,006,0002,113,536
2Jun 10, 2026 13:078,24876,370,57167,419,0001,043,0002,113,536
3Jun 10, 2026 13:078,25476,600,15967,491,0001,023,0002,113,536
4Jun 10, 2026 13:078,25576,104,63567,484,0001,035,0002,113,536
5Jun 10, 2026 13:078,26276,176,79067,576,0001,002,0002,113,536
6Jun 10, 2026 13:078,26976,307,36667,624,0001,009,0002,113,536
7Jun 10, 2026 13:078,27576,309,02167,682,0001,004,0002,113,536
8Jun 10, 2026 13:078,27976,711,92567,683,0001,035,0002,113,536
9Jun 10, 2026 13:078,30076,471,46967,854,0001,041,0002,113,536