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 11:02Rajarshi BasuRajarshi BasuScore: 6,803Success
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 11:026,74680,434,72354,990,000999,0002,289,664
2Dec 6, 2025 11:026,74682,001,07952,992,0002,999,0002,289,664
3Dec 6, 2025 11:026,75485,380,66354,060,0002,002,0002,273,280
4Dec 6, 2025 11:026,76681,997,44554,151,0002,005,0002,281,472
5Dec 6, 2025 11:026,77679,201,10855,235,0001,004,0002,273,280
6Dec 6, 2025 11:026,79979,776,45854,419,0002,015,0002,277,376
7Dec 6, 2025 11:026,80376,073,28254,449,0002,016,0002,289,664
8Dec 6, 2025 11:026,82786,602,99855,671,000994,0002,289,664
9Dec 6, 2025 11:026,89884,733,89255,248,0002,009,0002,277,376
10Dec 6, 2025 11:026,92783,459,86657,495,00002,281,472
11Dec 6, 2025 11:027,08085,420,55856,773,0001,992,0002,281,472
12Dec 6, 2025 11:027,17884,243,20157,561,0002,019,0002,269,184