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 22, 2025 04:23Josu San MartinJosu San MartinScore: 36,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 04:2336,182321,078,092299,311,0001,001,0002,265,088
2Dec 22, 2025 04:2336,199321,329,692300,451,00002,269,184
3Dec 22, 2025 04:2336,202331,938,943299,478,0001,001,0002,269,184
4Dec 22, 2025 04:2336,224330,009,977299,665,000998,0002,277,376
5Dec 22, 2025 04:2336,227327,056,043298,691,0001,997,0002,523,136
6Dec 22, 2025 04:2336,227324,615,283298,683,0001,997,0002,269,184
7Dec 22, 2025 04:2336,228328,313,790299,698,000998,0002,269,184
8Dec 22, 2025 04:2336,240323,602,449299,791,000999,0002,289,664
9Dec 22, 2025 04:2336,258328,912,958298,941,0001,999,0002,281,472