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 28, 2025 23:25Josu San MartinJosu San MartinScore: 34,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 23:5134,190310,395,111281,782,0001,998,0002,289,664
2Dec 28, 2025 23:2534,195315,315,394281,822,0001,998,0002,289,664
3Dec 28, 2025 23:5134,201308,433,035281,866,0001,999,0002,289,664
4Dec 28, 2025 23:2534,202307,582,416281,879,0001,999,0002,269,184
5Dec 28, 2025 23:5134,210310,409,876282,942,000999,0002,289,664
6Dec 28, 2025 23:2534,219307,159,499282,021,0002,000,0002,289,664