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 listSep 24, 2026 10:42wnwnScore: 3,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 10:433,28435,928,11626,230,0001,031,0002,113,536
2Sep 24, 2026 10:433,28836,072,51926,286,0001,005,0002,113,536
3Sep 24, 2026 10:433,29435,902,30626,297,0001,044,0002,113,536
4Sep 24, 2026 10:433,29636,191,77126,321,0001,040,0002,113,536
5Sep 24, 2026 10:433,29936,185,62926,379,0001,008,0002,113,536
6Sep 24, 2026 10:433,30336,223,53126,411,0001,005,0002,113,536
7Sep 24, 2026 10:433,31836,311,27226,537,0001,006,0002,113,536
8Sep 24, 2026 10:433,37336,668,02427,000,0001,004,0002,113,536
9Sep 24, 2026 10:433,39136,923,35327,125,0001,026,0002,113,536