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 15, 2026 14:12Mikołaj UzarskiMikołaj UzarskiScore: 6,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 14:146,03678,154,20543,082,0007,013,0002,355,200
2Feb 15, 2026 14:146,04680,869,65145,166,0005,018,0002,498,560
3Feb 15, 2026 14:146,08576,258,18645,456,0005,050,0002,400,256
4Feb 15, 2026 14:146,08874,440,10443,457,0007,074,0002,387,968
5Feb 15, 2026 14:146,09081,968,25244,485,0006,066,0002,510,848
6Feb 15, 2026 14:146,12182,186,12046,817,0003,984,0002,412,544
7Feb 15, 2026 14:146,13277,273,04245,908,0004,990,0002,355,200
8Feb 15, 2026 14:146,20674,456,02545,450,0006,060,0002,420,736
9Feb 15, 2026 14:146,24580,838,13644,858,0006,977,0002,277,376