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 listNov 2, 2025 20:27Jerry HuangJerry HuangScore: 2,066,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 20:272,063,57817,165,102,58417,068,731,00058,967,0002,285,568
2Nov 2, 2025 20:272,064,84917,175,689,42617,072,280,00065,966,0002,277,376
3Nov 2, 2025 20:272,066,35217,189,201,26417,076,758,00073,964,0002,265,088
4Nov 2, 2025 20:272,066,49117,182,614,38617,084,908,00066,964,0002,281,472
5Nov 2, 2025 20:272,066,50117,184,335,79517,076,992,00074,964,0002,260,992
6Nov 2, 2025 20:272,067,28317,190,902,18517,093,480,00064,971,0002,277,376
7Nov 2, 2025 20:272,070,58717,219,626,53617,108,916,00076,959,0002,277,376
8Nov 2, 2025 20:272,071,93317,228,537,62617,120,088,00076,959,0002,273,280
9Nov 2, 2025 20:272,243,76618,654,616,67518,561,287,00061,970,0002,269,184