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 14, 2026 13:20marko1597marko1597Score: 6,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:206,76166,007,13255,064,0001,059,0002,113,536
2Aug 14, 2026 13:206,76265,923,25855,075,0001,050,0002,113,536
3Aug 14, 2026 13:206,76766,001,54955,137,0001,037,0002,113,536
4Aug 14, 2026 13:206,76866,624,11555,077,0001,105,0002,117,632
5Aug 14, 2026 13:206,79767,309,16255,242,0001,181,0002,113,536
6Aug 14, 2026 13:206,94067,397,04256,412,0001,197,0002,113,536
7Aug 14, 2026 13:206,95867,581,43656,702,0001,057,0002,113,536
8Aug 14, 2026 13:207,06068,402,38357,555,0001,045,0002,113,536
9Aug 14, 2026 13:207,22169,752,76458,771,0001,169,0002,113,536