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:01Victor MerckléVictor MerckléScore: 4,618Success
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:024,60445,838,04937,130,0001,086,0002,113,536
2Jun 10, 2026 13:024,60845,834,91037,151,0001,099,0002,113,536
3Jun 10, 2026 13:024,60945,661,83037,126,0001,131,0002,113,536
4Jun 10, 2026 13:024,61545,950,05137,275,0001,036,0002,113,536
5Jun 10, 2026 13:024,61845,941,86837,327,0001,010,0002,113,536
6Jun 10, 2026 13:024,61945,920,70937,342,0001,003,0002,113,536
7Jun 10, 2026 13:024,61945,935,37437,314,0001,024,0002,113,536
8Jun 10, 2026 13:024,62145,927,44037,318,0001,038,0002,113,536
9Jun 10, 2026 13:024,62345,983,86337,280,0001,093,0002,113,536