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,638Success
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,59974,462,26543,441,0003,030,0002,523,136
2Feb 21, 2026 14:085,60869,963,61242,498,0004,047,0002,265,088
3Feb 21, 2026 14:085,61174,487,53144,550,0002,025,0002,289,664
4Feb 21, 2026 14:085,61674,379,26843,573,0003,040,0002,326,528
5Feb 21, 2026 14:085,63277,278,58942,771,0003,978,0002,523,136
6Feb 21, 2026 14:085,63674,617,22342,796,0003,981,0002,326,528
7Feb 21, 2026 14:085,63883,363,19042,816,0003,982,0002,523,136
8Feb 21, 2026 14:085,66468,557,19443,012,0004,001,0002,318,336
9Feb 21, 2026 14:085,68076,774,23645,142,0002,006,0002,322,432
10Feb 21, 2026 14:085,68874,893,09143,195,0004,018,0002,306,048
11Feb 21, 2026 14:085,69571,445,61044,250,0003,017,0002,260,992
12Feb 21, 2026 14:085,70072,924,91343,287,0004,026,0002,306,048