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 18, 2026 09:57wnwnScore: 7,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:096,22480,178,12948,623,0003,038,0002,351,104
2Feb 18, 2026 10:096,24077,593,34047,812,0003,984,0002,359,296
3Feb 18, 2026 09:576,26577,467,37448,999,0002,999,0002,371,584
4Feb 18, 2026 09:576,29375,122,96249,220,0003,013,0002,519,040
5Feb 18, 2026 10:096,31777,154,47950,415,0002,016,0002,363,392
6Feb 18, 2026 09:576,34177,299,23849,597,0003,036,0002,306,048
7Feb 18, 2026 09:577,13881,786,51356,236,0003,012,0002,379,776
8Feb 18, 2026 10:097,23984,410,07758,080,0002,002,0002,486,272
9Feb 18, 2026 10:097,27487,524,95257,354,0003,018,0002,375,680
10Feb 18, 2026 09:577,28386,724,93158,434,0002,014,0002,457,600
11Feb 18, 2026 09:577,32294,686,58657,783,0002,988,0002,502,656
12Feb 18, 2026 10:097,38190,577,13157,247,0004,017,0002,502,656