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 24, 2026 23:01Victor MerckléVictor MerckléScore: 4,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:024,17143,466,07633,496,0001,125,0002,113,536
2Jun 24, 2026 23:024,17842,146,55333,569,0001,113,0002,113,536
3Jun 24, 2026 23:024,17942,624,99433,546,0001,143,0002,113,536
4Jun 24, 2026 23:024,20442,421,28733,829,0001,071,0002,113,536
5Jun 24, 2026 23:024,21342,705,64833,871,0001,099,0002,113,536
6Jun 24, 2026 23:024,23142,571,17834,088,0001,036,0002,113,536
7Jun 24, 2026 23:024,32943,509,81634,815,0001,121,0002,113,536
8Jun 24, 2026 23:024,33043,419,78434,826,0001,118,0002,113,536
9Jun 24, 2026 23:024,35643,687,46135,060,0001,101,0002,113,536