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 2, 2025 17:20Marco BarboneMarco BarboneScore: 37,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 17:2037,130329,185,438307,180,0001,000,0002,289,664
2Aug 2, 2025 17:2037,193338,104,926306,707,0001,998,0002,289,664
3Aug 2, 2025 17:2037,495333,209,035310,212,0001,000,0002,289,664
4Aug 2, 2025 17:2037,517332,344,035310,388,0001,001,0002,265,088
5Aug 2, 2025 17:2037,673338,611,240310,687,0001,997,0002,289,664
6Aug 2, 2025 17:2038,181339,361,947314,905,0001,999,0002,367,488
7Aug 2, 2025 17:2038,414344,752,403316,840,0001,998,0002,260,992
8Aug 2, 2025 17:2038,449350,155,450317,127,0002,000,0002,265,088
9Aug 2, 2025 17:2038,515345,888,927318,675,000998,0002,265,088