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 8, 2025 11:35Jatin GargJatin GargScore: 523,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:35521,5864,355,073,1624,256,196,00072,969,0002,387,968
2Dec 8, 2025 11:35521,6754,362,932,7114,261,938,00067,967,0002,273,280
3Dec 8, 2025 11:35522,5694,368,201,1584,255,376,00081,949,0002,273,280
4Dec 8, 2025 11:35522,8734,372,735,8094,271,876,00067,966,0002,383,872
5Dec 8, 2025 11:35523,0414,367,412,5274,272,266,00068,972,0002,273,280
6Dec 8, 2025 11:35523,2474,371,284,9484,278,948,00063,999,0002,273,280
7Dec 8, 2025 11:35524,1554,381,028,6884,288,519,00061,964,0002,273,280
8Dec 8, 2025 11:35524,2264,377,128,2214,288,105,00062,972,0002,273,280
9Dec 8, 2025 11:35527,1954,401,870,1554,300,762,00074,960,0002,273,280