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 00:36Daniel MastalerzDaniel MastalerzScore: 6,243Success
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 00:366,21776,931,49249,581,0002,023,0002,265,088
2Feb 18, 2026 00:366,21877,879,10948,575,0003,035,0002,318,336
3Feb 18, 2026 00:366,22082,396,60649,601,0002,024,0002,326,528
4Feb 18, 2026 00:366,22280,380,83349,619,0002,025,0002,326,528
5Feb 18, 2026 00:366,23576,666,55347,770,0003,980,0002,306,048
6Feb 18, 2026 00:366,24175,366,79848,816,0002,988,0002,326,528
7Feb 18, 2026 00:366,24378,322,64347,828,0003,985,0002,523,136
8Feb 18, 2026 00:366,24574,581,42347,846,0003,987,0002,269,184
9Feb 18, 2026 00:366,25980,244,47747,957,0003,996,0002,326,528
10Feb 18, 2026 00:366,34080,891,50749,584,0003,035,0002,265,088
11Feb 18, 2026 00:366,35280,213,92049,734,0002,984,0002,277,376
12Feb 18, 2026 00:366,37377,719,62648,907,0003,992,0002,318,336