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 18, 2026 14:29Victor MerckléVictor MerckléScore: 15,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 14:3015,142133,351,524124,566,0001,114,0002,113,536
2Jun 18, 2026 14:3015,144133,404,844124,561,0001,137,0002,113,536
3Jun 18, 2026 14:3015,145133,364,044124,636,0001,068,0002,113,536
4Jun 18, 2026 14:3015,193133,808,485125,102,0001,005,0002,113,536
5Jun 18, 2026 14:3015,196133,801,952125,014,0001,114,0002,113,536
6Jun 18, 2026 14:3015,203133,881,866125,113,0001,078,0002,113,536
7Jun 18, 2026 14:3015,230134,079,833125,384,0001,026,0002,113,536
8Jun 18, 2026 14:3015,378135,363,385126,569,0001,072,0002,113,536
9Jun 18, 2026 14:3015,441135,871,659127,057,0001,105,0002,113,536