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 listFeb 18, 2026 15:27wnwnScore: 7,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:277,35386,270,38160,034,0001,000,0002,449,408
2Feb 18, 2026 15:277,37385,664,12559,189,0002,006,0002,281,472
3Feb 18, 2026 15:277,38082,058,91259,248,0002,008,0002,433,024
4Feb 18, 2026 15:277,38388,248,12860,271,0001,004,0002,277,376
5Feb 18, 2026 15:277,38990,878,09359,320,0002,010,0002,281,472
6Feb 18, 2026 15:277,39587,761,31460,373,0001,006,0002,441,216