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 12, 2026 00:09olliecrowolliecrowScore: 6,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 00:096,12279,791,46647,827,0002,989,0002,506,752
2Feb 12, 2026 00:096,12975,581,22847,882,0002,992,0002,338,816
3Feb 12, 2026 00:096,31174,757,74649,361,0003,022,0002,330,624
4Feb 12, 2026 00:096,39379,992,15452,059,0001,001,0002,461,696
5Feb 12, 2026 00:096,44783,367,67950,479,0003,028,0002,453,504
6Feb 12, 2026 00:096,63076,819,00452,030,0003,001,0002,461,696