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 6, 2025 15:26Rajarshi BasuRajarshi BasuScore: 6,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:266,15878,979,18448,106,0003,006,0002,289,664
2Dec 6, 2025 15:266,18076,132,20549,280,0002,011,0002,289,664
3Dec 6, 2025 15:266,26675,526,00550,009,0002,000,0002,289,664
4Dec 6, 2025 15:266,29373,707,16650,225,0002,009,0002,392,064
5Dec 6, 2025 15:266,29875,443,88350,262,0002,010,0002,273,280
6Dec 6, 2025 15:266,31076,211,02251,363,0001,007,0002,289,664