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 29, 2025 06:55Josu San MartinJosu San MartinScore: 30,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 06:5530,089275,787,551248,740,000998,0002,273,280
2Dec 29, 2025 06:5530,096276,758,098247,800,0001,998,0002,281,472
3Dec 29, 2025 06:5530,111280,622,931247,921,0001,999,0002,400,256
4Dec 29, 2025 06:5530,113274,932,830248,938,000999,0002,281,472
5Dec 29, 2025 06:5530,119280,269,482248,992,000999,0002,400,256
6Dec 29, 2025 06:5530,124279,799,649248,030,0002,000,0002,408,448
7Dec 29, 2025 06:5530,130272,612,301249,077,0001,000,0002,273,280
8Dec 29, 2025 06:5530,132274,769,947248,092,0002,000,0002,273,280
9Dec 29, 2025 06:5530,155272,732,339249,289,0001,001,0002,273,280