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 listDec 29, 2025 10:40Aman | अमनAman | अमनScore: 71,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 10:4070,968616,273,737530,030,00059,003,0002,281,472
2Dec 29, 2025 10:4071,036612,846,878531,541,00058,059,0002,281,472
3Dec 29, 2025 10:4071,099616,789,805532,110,00058,011,0002,383,872
4Dec 29, 2025 10:4071,189615,313,792532,881,00057,987,0002,387,968
5Dec 29, 2025 10:4071,283613,431,060530,685,00060,963,0002,281,472
6Dec 29, 2025 10:4071,283620,267,742531,688,00059,964,0002,281,472
7Dec 29, 2025 10:4071,321614,106,610534,969,00056,996,0002,392,064
8Dec 29, 2025 10:4071,327614,628,463536,011,00056,001,0002,379,776
9Dec 29, 2025 10:4071,381620,515,830533,518,00058,946,0002,383,872