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 15:00Juraj ZelmanJuraj ZelmanScore: 8,079Success
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 15:008,01894,072,27565,538,0001,008,0002,355,200
2Feb 21, 2026 15:008,01885,537,16165,541,0001,008,0002,363,392
3Feb 21, 2026 15:008,04795,362,22664,794,0001,993,0002,285,568
4Feb 21, 2026 15:008,06392,373,34764,925,0001,997,0002,293,760
5Feb 21, 2026 15:008,06997,788,46964,974,0001,999,0002,293,760
6Feb 21, 2026 15:008,06993,762,55864,974,0001,999,0002,469,888
7Feb 21, 2026 15:008,07993,980,88065,053,0002,001,0002,465,792
8Feb 21, 2026 15:008,08490,642,66866,096,0001,001,0002,293,760
9Feb 21, 2026 15:008,09391,804,60965,165,0002,005,0002,293,760
10Feb 21, 2026 15:008,11094,062,66767,313,00002,293,760
11Feb 21, 2026 15:008,13590,446,88767,524,00002,355,200
12Feb 21, 2026 15:008,17794,126,99666,869,000998,0002,285,568