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:19Daniel MastalerzDaniel MastalerzScore: 5,657Success
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:195,56272,993,87042,151,0004,014,0002,322,432
2Feb 21, 2026 14:195,56969,030,65042,200,0004,019,0002,523,136
3Feb 21, 2026 14:195,57268,646,51142,225,0004,021,0002,523,136
4Feb 21, 2026 14:195,58068,746,61642,290,0004,027,0002,523,136
5Feb 21, 2026 14:195,64478,909,45242,860,0003,986,0002,285,568
6Feb 21, 2026 14:195,65772,802,76542,961,0003,996,0002,281,472
7Feb 21, 2026 14:195,65771,807,28842,961,0003,996,0002,306,048
8Feb 21, 2026 14:195,66568,699,77343,015,0004,001,0002,277,376
9Feb 21, 2026 14:195,68669,505,93243,180,0004,016,0002,260,992
10Feb 21, 2026 14:195,70473,645,00043,316,0004,029,0002,306,048
11Feb 21, 2026 14:195,78176,984,45243,986,0003,998,0002,326,528
12Feb 21, 2026 14:196,04181,794,38946,129,0004,011,0002,318,336