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 20, 2026 09:45Victor MerckléVictor MerckléScore: 14,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 09:4614,010123,918,703115,264,0001,019,0002,113,536
2Jun 20, 2026 09:4614,020124,114,828115,330,0001,037,0002,113,536
3Jun 20, 2026 09:4614,025124,025,739115,383,0001,028,0002,113,536
4Jun 20, 2026 09:4614,040124,196,984115,471,0001,066,0002,113,536
5Jun 20, 2026 09:4614,052124,248,650115,585,0001,052,0002,113,536
6Jun 20, 2026 09:4614,097124,634,647115,838,0001,172,0002,113,536
7Jun 20, 2026 09:4614,206125,733,522116,838,0001,077,0002,113,536
8Jun 20, 2026 09:4614,222125,627,893117,016,0001,032,0002,113,536
9Jun 20, 2026 09:4614,258126,044,680117,303,0001,039,0002,113,536