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:48CodeReclaimersCodeReclaimersScore: 48,715Success
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:4948,603413,283,767344,234,00059,175,0002,113,536
2Jul 30, 2026 14:4948,699414,059,704344,152,00060,056,0002,113,536
3Jul 30, 2026 14:4948,700414,116,379344,369,00059,844,0002,113,536
4Jul 30, 2026 14:4948,705414,240,558344,339,00059,915,0002,113,536
5Jul 30, 2026 14:4948,715414,318,232344,467,00059,873,0002,113,536
6Jul 30, 2026 14:4948,730414,363,483343,608,00060,855,0002,113,536
7Jul 30, 2026 14:4948,732415,476,616344,380,00060,103,0002,113,536
8Jul 30, 2026 14:4948,743414,818,110344,487,00060,085,0002,113,536
9Jul 30, 2026 14:4948,776415,144,749344,237,00060,611,0002,113,536