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 24, 2026 19:12Daniel MastalerzDaniel MastalerzScore: 5,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:135,47669,813,15841,408,0004,039,0002,514,944
2Feb 24, 2026 19:125,49472,668,80342,564,0003,040,0002,326,528
3Feb 24, 2026 19:135,49576,917,88342,565,0003,040,0002,306,048
4Feb 24, 2026 19:135,51976,832,39742,819,0002,987,0002,314,240
5Feb 24, 2026 19:125,52178,471,34441,842,0003,984,0002,326,528
6Feb 24, 2026 19:135,57373,273,09642,232,0004,022,0002,318,336
7Feb 24, 2026 19:125,57468,943,91343,244,0003,017,0002,519,040
8Feb 24, 2026 19:135,59173,975,44042,371,0004,035,0002,301,952
9Feb 24, 2026 19:125,59368,785,24443,392,0003,027,0002,265,088
10Feb 24, 2026 19:125,60574,909,55243,491,0003,034,0002,269,184
11Feb 24, 2026 19:135,60670,089,74443,494,0003,034,0002,310,144
12Feb 24, 2026 19:125,63772,984,23343,801,0002,986,0002,265,088