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 listFeb 17, 2026 20:45wnwnScore: 7,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 20:457,20790,704,24456,827,0002,990,0002,375,680
2Feb 17, 2026 20:457,26485,712,78656,274,0004,019,0002,478,080
3Feb 17, 2026 20:457,28282,799,91058,424,0002,014,0002,416,640
4Feb 17, 2026 20:457,35086,349,84359,008,0002,000,0002,408,448
5Feb 17, 2026 20:457,51786,512,82760,381,0002,012,0002,433,024
6Feb 17, 2026 20:457,61785,392,81760,214,0003,010,0002,387,968