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 19, 2026 23:17Mikołaj UzarskiMikołaj UzarskiScore: 5,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:175,77373,451,75142,927,0004,991,0002,465,792
2Feb 19, 2026 23:175,80671,462,97343,172,0005,020,0002,449,408
3Feb 19, 2026 23:175,80974,683,68241,185,0007,031,0002,441,216
4Feb 19, 2026 23:175,81070,588,37042,199,0006,028,0002,478,080
5Feb 19, 2026 23:175,90373,065,25344,996,0003,999,0002,465,792
6Feb 19, 2026 23:175,90976,986,07444,039,0005,004,0002,310,144