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 6, 2025 12:14Vladimir EvmenovVladimir EvmenovScore: 64,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 12:1464,036564,579,049471,553,00059,943,0002,285,568
2Feb 6, 2025 12:1464,084558,915,871471,906,00059,988,0002,510,848
3Feb 6, 2025 12:1464,086561,664,490464,924,00066,989,0002,293,760
4Feb 6, 2025 12:1464,133556,041,889468,265,00064,036,0002,293,760
5Feb 6, 2025 12:1464,168558,246,204467,642,00064,950,0002,293,760
6Feb 6, 2025 12:1464,168562,224,038471,642,00060,953,0002,293,760
7Feb 6, 2025 12:1464,188558,839,190469,791,00062,972,0002,289,664
8Feb 6, 2025 12:1464,194558,601,987469,830,00062,977,0002,510,848
9Feb 6, 2025 12:1464,319564,958,815466,869,00066,981,0002,510,848