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 12:02Rajarshi BasuRajarshi BasuScore: 7,126Success
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 12:026,97685,173,49855,906,0001,996,0002,527,232
2Dec 6, 2025 12:027,10490,681,20256,967,0001,998,0002,289,664
3Dec 6, 2025 12:027,10790,642,09856,993,0001,999,0002,289,664
4Dec 6, 2025 12:027,12683,411,37656,142,0003,007,0002,289,664
5Dec 6, 2025 12:027,26284,086,26958,263,0002,009,0002,281,472
6Dec 6, 2025 12:027,29890,063,57359,567,0001,009,0002,297,856