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 15, 2025 14:09Serhat ErenSerhat ErenScore: 394,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2025 14:09394,4753,301,959,8303,196,185,00077,955,0002,289,664
2Aug 15, 2025 14:09394,6473,298,342,3153,208,603,00066,970,0002,281,472
3Aug 15, 2025 14:09394,7333,302,173,8403,199,321,00076,959,0002,281,472
4Aug 15, 2025 14:09394,8693,302,868,3433,204,450,00072,964,0002,285,568
5Aug 15, 2025 14:09394,9253,304,461,3353,204,925,00072,952,0002,285,568
6Aug 15, 2025 14:09396,6743,322,033,8203,218,434,00073,964,0002,281,472
7Aug 15, 2025 14:09398,0233,329,768,5633,225,647,00077,943,0002,285,568
8Aug 15, 2025 14:09406,3233,396,545,8653,316,508,00055,974,0002,289,664
9Aug 15, 2025 14:09412,4813,448,635,9153,350,620,00072,969,0002,285,568