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 17:25CodeReclaimersCodeReclaimersScore: 16,466Success
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 17:2516,385146,144,350133,792,0002,211,0002,113,536
2Jul 30, 2026 17:2516,391146,262,131133,895,0002,151,0002,113,536
3Jul 30, 2026 17:2516,392146,156,960133,907,0002,154,0002,113,536
4Jul 30, 2026 17:2516,439146,567,692134,334,0002,113,0002,117,632
5Jul 30, 2026 17:2516,466146,844,037134,445,0002,225,0002,113,536
6Jul 30, 2026 17:2516,524147,250,896135,046,0002,109,0002,113,536
7Jul 30, 2026 17:2516,544147,510,724135,078,0002,238,0002,113,536
8Jul 30, 2026 17:2516,656148,376,047136,153,0002,098,0002,113,536
9Jul 30, 2026 17:2516,826150,501,553137,420,0002,243,0002,113,536