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 3, 2025 15:29Rajarshi BasuRajarshi BasuScore: 12,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 15:2911,796118,488,09395,906,0001,998,0002,498,560
2Dec 3, 2025 15:2911,813124,144,29596,051,0002,001,0002,289,664
3Dec 3, 2025 15:2911,874124,885,82696,543,0002,011,0002,494,464
4Dec 3, 2025 15:2912,082121,971,89498,272,0002,005,0002,289,664
5Dec 3, 2025 15:2912,084124,960,96498,293,0002,005,0002,289,664
6Dec 3, 2025 15:2912,084121,759,63698,292,0002,005,0002,490,368