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 listApr 21, 2026 17:18Stefan Antoniu OpreaStefan Antoniu OpreaScore: 61,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 17:1961,512533,028,125509,552,000999,0002,363,392
2Apr 21, 2026 17:1961,621531,671,147509,454,0002,001,0002,359,296
3Apr 21, 2026 17:1961,622527,521,745510,465,0001,000,0002,375,680
4Apr 21, 2026 17:1961,638529,184,890510,599,000999,0002,437,120
5Apr 21, 2026 17:1961,642529,253,866509,632,0001,998,0002,355,200
6Apr 21, 2026 17:1961,653533,126,966508,728,0002,998,0002,367,488
7Apr 21, 2026 17:1961,664530,496,612509,818,0001,999,0002,293,760
8Apr 21, 2026 17:1961,686533,300,840509,996,0001,999,0002,367,488
9Apr 21, 2026 17:1961,691531,466,581511,037,0001,000,0002,293,760