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 listJul 30, 2026 14:43CodeReclaimersCodeReclaimersScore: 46,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 14:4446,121393,679,841322,004,00060,804,0002,113,536
2Jul 30, 2026 14:4446,129392,962,791321,863,00061,014,0002,113,536
3Jul 30, 2026 14:4446,132393,718,310322,021,00060,876,0002,113,536
4Jul 30, 2026 14:4446,140393,827,845321,885,00061,085,0002,113,536
5Jul 30, 2026 14:4446,143393,791,706321,934,00061,058,0002,113,536
6Jul 30, 2026 14:4446,155393,960,614322,009,00061,080,0002,113,536
7Jul 30, 2026 14:4446,169393,217,017322,113,00061,096,0002,113,536
8Jul 30, 2026 14:4446,173394,045,994322,051,00061,191,0002,113,536
9Jul 30, 2026 14:4446,180393,441,382322,025,00061,275,0002,113,536