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 21, 2026 14:08Daniel MastalerzDaniel MastalerzScore: 5,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 14:085,62567,799,05343,710,0002,980,0002,273,280
2Feb 21, 2026 14:085,64872,904,86542,888,0003,989,0002,523,136
3Feb 21, 2026 14:085,67274,175,23145,076,0002,003,0002,326,528
4Feb 21, 2026 14:085,70775,794,09043,338,0004,031,0002,318,336
5Feb 21, 2026 14:085,70873,802,70144,355,0003,024,0002,383,872
6Feb 21, 2026 14:085,71070,514,62344,370,0003,025,0002,318,336