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 listAug 22, 2025 13:16Ashish AhujaAshish AhujaScore: 11,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 13:3911,144125,056,23470,615,00021,880,0002,412,544
2Aug 22, 2025 13:3911,170124,282,30672,770,00019,937,0002,457,600
3Aug 22, 2025 13:3911,243122,028,20973,461,00019,854,0002,449,408
4Aug 22, 2025 13:1611,342117,973,47270,354,00023,781,0002,506,752
5Aug 22, 2025 13:1611,353123,021,38775,382,00018,845,0002,502,656
6Aug 22, 2025 13:3911,387123,381,11675,610,00018,902,0002,506,752
7Aug 22, 2025 13:3911,390123,223,68977,622,00016,917,0002,502,656
8Aug 22, 2025 13:1611,432123,546,01672,912,00021,973,0002,453,504
9Aug 22, 2025 13:1611,648119,167,25177,742,00018,937,0002,428,928
10Aug 22, 2025 13:1611,699126,539,06482,238,00014,862,0002,416,640
11Aug 22, 2025 13:3911,716120,662,73883,354,00013,892,0002,506,752
12Aug 22, 2025 13:1611,721126,132,55679,417,00017,868,0002,322,432