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 listAug 23, 2026 17:33Victor MerckléVictor MerckléScore: 3,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:353,73039,388,97529,806,0001,157,0002,117,632stderr
2Aug 23, 2026 17:353,74240,176,02729,948,0001,116,0002,117,632stderr
3Aug 23, 2026 17:353,74839,542,38629,952,0001,158,0002,117,632stderr
4Aug 23, 2026 17:353,75039,512,09030,082,0001,049,0002,117,632stderr
5Aug 23, 2026 17:353,75439,554,46030,025,0001,141,0002,117,632stderr
6Aug 23, 2026 17:353,76439,633,53830,123,0001,125,0002,117,632stderr
7Aug 23, 2026 17:353,77240,340,81830,173,0001,137,0002,117,632stderr
8Aug 23, 2026 17:353,79139,865,22130,354,0001,115,0002,117,632stderr
9Aug 23, 2026 17:353,94341,769,38131,616,0001,114,0002,117,632stderr