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 29, 2026 06:18Victor MerckléVictor MerckléScore: 11,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 06:1911,808105,894,53996,996,0001,014,0002,117,632stderr
2Jun 29, 2026 06:1911,814105,980,14196,956,0001,103,0002,117,632stderr
3Jun 29, 2026 06:1911,831106,180,67297,101,0001,104,0002,117,632stderr
4Jun 29, 2026 06:1911,878106,472,18397,561,0001,032,0002,117,632stderr
5Jun 29, 2026 06:1911,882106,554,30997,492,0001,131,0002,117,632stderr
6Jun 29, 2026 06:1911,890106,610,96097,618,0001,073,0002,117,632stderr
7Jun 29, 2026 06:1911,898106,639,41297,709,0001,050,0002,117,632stderr
8Jun 29, 2026 06:1912,011107,662,79298,682,0001,015,0002,117,632stderr
9Jun 29, 2026 06:1912,053107,950,45598,996,0001,051,0002,117,632stderr