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:26Daniel MastalerzDaniel MastalerzScore: 5,641Success
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:265,61270,714,75143,541,0003,037,0002,383,872
2Feb 21, 2026 14:265,62175,184,21042,685,0003,970,0002,523,136
3Feb 21, 2026 14:265,63771,243,56141,809,0004,977,0002,289,664
4Feb 21, 2026 14:265,63774,129,08642,806,0003,981,0002,318,336
5Feb 21, 2026 14:265,64173,811,11842,835,0003,984,0002,351,104
6Feb 21, 2026 14:265,68470,002,70643,162,0004,015,0002,310,144
7Feb 21, 2026 14:265,69668,993,91144,260,0003,017,0002,310,144
8Feb 21, 2026 14:265,73078,647,66044,525,0003,035,0002,269,184
9Feb 21, 2026 14:265,78876,891,46043,037,0005,004,0002,367,488