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 8, 2025 19:11RyhbtRyhbtScore: 58,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 19:1158,143504,537,435480,585,0001,998,0002,506,752
2Aug 8, 2025 19:1158,163509,687,918480,757,0001,998,0002,281,472
3Aug 8, 2025 19:1158,166506,492,020479,782,0002,998,0002,277,376
4Aug 8, 2025 19:1158,837510,233,436487,349,0001,000,0002,277,376
5Aug 8, 2025 19:1158,864514,421,788486,573,0001,998,0002,502,656
6Aug 8, 2025 19:1158,873518,662,282486,645,0001,998,0002,281,472
7Aug 8, 2025 19:1158,874510,500,456486,660,0001,998,0002,506,752
8Aug 8, 2025 19:1158,877511,228,157486,679,0001,998,0002,506,752
9Aug 8, 2025 19:1158,896516,848,847483,841,0004,998,0002,281,472