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:42Victor MerckléVictor MerckléScore: 4,881Success
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:434,87748,125,57639,377,0001,107,0002,113,536
2Jun 24, 2026 23:434,87948,187,03839,392,0001,104,0002,113,536
3Jun 24, 2026 23:434,87948,403,31239,415,0001,087,0002,113,536
4Jun 24, 2026 23:434,88048,011,43639,391,0001,116,0002,113,536
5Jun 24, 2026 23:434,88148,135,60839,411,0001,104,0002,113,536
6Jun 24, 2026 23:434,88748,111,94639,454,0001,113,0002,113,536
7Jun 24, 2026 23:434,90348,561,72639,584,0001,117,0002,113,536
8Jun 24, 2026 23:434,90548,423,81239,654,0001,061,0002,113,536
9Jun 24, 2026 23:434,93948,578,96739,909,0001,087,0002,113,536