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:07Victor MerckléVictor MerckléScore: 4,251Success
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:084,24143,124,57434,104,0001,097,0002,113,536
2Jun 24, 2026 23:084,24143,173,03534,098,0001,103,0002,113,536
3Jun 24, 2026 23:084,24644,477,20434,144,0001,098,0002,113,536
4Jun 24, 2026 23:084,24842,865,36934,147,0001,112,0002,113,536
5Jun 24, 2026 23:084,25143,087,35934,176,0001,111,0002,113,536
6Jun 24, 2026 23:084,27143,048,83934,428,0001,022,0002,113,536
7Jun 24, 2026 23:084,27943,103,56834,425,0001,094,0002,113,536
8Jun 24, 2026 23:084,37343,980,96335,176,0001,128,0002,113,536
9Jun 24, 2026 23:084,43744,572,48935,734,0001,097,0002,113,536