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 19, 2026 15:44Victor MerckléVictor MerckléScore: 29,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 15:4629,485252,397,356243,644,0001,087,0002,113,536
2Jun 19, 2026 15:4629,495252,452,541243,717,0001,096,0002,113,536
3Jun 19, 2026 15:4629,496252,559,521243,738,0001,083,0002,113,536
4Jun 19, 2026 15:4629,497252,494,424243,740,0001,092,0002,113,536
5Jun 19, 2026 15:4629,498252,524,729243,826,0001,009,0002,113,536
6Jun 19, 2026 15:4629,507253,903,384243,853,0001,062,0002,113,536
7Jun 19, 2026 15:4629,531252,719,883244,082,0001,031,0002,113,536
8Jun 19, 2026 15:4629,643253,782,916244,868,0001,175,0002,113,536
9Jun 19, 2026 15:4630,251258,724,040250,028,0001,060,0002,113,536