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 listApr 30, 2025 07:43Shun YamanakaShun YamanakaScore: 385,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2025 07:43385,0383,221,838,6883,128,841,00066,975,0002,281,472
2Apr 30, 2025 07:43385,1233,220,301,3773,133,549,00062,970,0002,281,472
3Apr 30, 2025 07:43385,4113,225,924,2803,102,943,00095,967,0002,281,472
4Apr 30, 2025 07:43385,7023,226,916,0123,152,351,00048,974,0002,281,472
5Apr 30, 2025 07:43385,8673,230,455,4723,150,722,00051,978,0002,281,472
6Apr 30, 2025 07:43388,5863,252,934,0733,147,306,00077,958,0002,289,664
7Apr 30, 2025 07:43388,7783,255,086,2433,145,909,00080,946,0002,285,568
8Apr 30, 2025 07:43388,8293,254,405,1073,165,317,00061,967,0002,367,488
9Apr 30, 2025 07:43390,5443,263,212,1643,177,545,00063,970,0002,285,568