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 7, 2026 19:01Victor MerckléVictor MerckléScore: 12,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:0212,120108,293,15799,522,0001,082,0002,113,536
2Jun 7, 2026 19:0212,141108,746,80799,699,0001,079,0002,113,536
3Jun 7, 2026 19:0212,141108,507,43899,657,0001,117,0002,113,536
4Jun 7, 2026 19:0212,159108,595,88599,897,0001,029,0002,113,536
5Jun 7, 2026 19:0212,163108,636,65299,930,0001,028,0002,113,536
6Jun 7, 2026 19:0212,175108,739,119100,053,0001,004,0002,113,536
7Jun 7, 2026 19:0212,183108,788,039100,106,0001,015,0002,113,536
8Jun 7, 2026 19:0212,622112,438,735103,733,0001,037,0002,113,536
9Jun 7, 2026 19:0212,646113,977,077103,942,0001,020,0002,113,536