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 18, 2026 23:51Mikołaj UzarskiMikołaj UzarskiScore: 5,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:515,94774,154,89542,308,0007,051,0002,502,656
2Feb 18, 2026 23:515,96170,169,99744,425,0005,048,0002,367,488
3Feb 18, 2026 23:516,01177,926,33542,908,0006,985,0002,523,136