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 13, 2026 19:57Daniel MastalerzDaniel MastalerzScore: 7,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 19:577,96194,298,48762,074,0004,004,0002,371,584
2Feb 13, 2026 19:577,96388,839,24462,088,0004,005,0002,330,624
3Feb 13, 2026 19:577,97098,437,12763,144,0003,006,0002,330,624
4Feb 13, 2026 19:577,97194,808,66163,155,0003,007,0002,310,144
5Feb 13, 2026 19:577,97795,266,68163,196,0003,009,0002,330,624
6Feb 13, 2026 19:577,98088,473,21664,230,0002,007,0002,265,088
7Feb 13, 2026 19:577,98290,081,45462,234,0004,015,0002,277,376
8Feb 13, 2026 19:577,98991,504,17362,291,0004,018,0002,523,136
9Feb 13, 2026 19:577,99090,134,34762,301,0004,019,0002,265,088
10Feb 13, 2026 19:578,14091,844,75165,542,0002,016,0002,273,280
11Feb 13, 2026 19:578,14895,531,18765,610,0002,018,0002,306,048
12Feb 13, 2026 19:578,14997,512,32266,627,0001,009,0002,322,432