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 14, 2026 23:36Andrew TsibinAndrew TsibinScore: 5,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:365,11152,066,91841,231,0001,198,0002,113,536
2Jul 14, 2026 23:365,12162,383,25241,476,0001,036,0002,117,632
3Jul 14, 2026 23:365,14152,239,16241,665,0001,011,0002,113,536
4Jul 14, 2026 23:365,14163,028,74341,645,0001,033,0002,113,536
5Jul 14, 2026 23:365,14852,324,16441,728,0001,007,0002,113,536
6Jul 14, 2026 23:365,16352,422,25541,676,0001,185,0002,113,536
7Jul 14, 2026 23:365,19052,849,88942,064,0001,013,0002,113,536
8Jul 14, 2026 23:365,19952,740,91642,148,0001,009,0002,113,536
9Jul 14, 2026 23:365,22152,955,84242,333,0001,009,0002,113,536