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 23, 2026 16:00Kasper KivimäkiKasper KivimäkiScore: 61,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:0060,710513,539,390502,888,0001,012,0002,113,536
2Jul 23, 2026 16:0060,802514,400,021503,538,0001,124,0002,113,536
3Jul 23, 2026 16:0060,805514,676,214503,661,0001,023,0002,113,536
4Jul 23, 2026 16:0061,106516,981,373506,123,0001,064,0002,113,536
5Jul 23, 2026 16:0061,319518,792,709507,880,0001,072,0002,113,536
6Jul 23, 2026 16:0061,442519,767,486508,860,0001,109,0002,113,536
7Jul 23, 2026 16:0061,715522,034,216511,071,0001,165,0002,113,536
8Jul 23, 2026 16:0061,807522,673,278511,965,0001,035,0002,113,536
9Jul 23, 2026 16:0061,830522,996,355512,146,0001,051,0002,113,536