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 04:54wnwnScore: 3,365Success
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 04:543,35036,590,91526,806,0001,005,0002,113,536
2Sep 24, 2026 04:543,35536,594,99026,850,0001,001,0002,113,536
3Sep 24, 2026 04:543,36336,638,05726,888,0001,028,0002,113,536
4Sep 24, 2026 04:543,36436,666,00126,901,0001,028,0002,113,536
5Sep 24, 2026 04:543,36536,686,54126,884,0001,047,0002,113,536
6Sep 24, 2026 04:543,37736,759,51827,013,0001,022,0002,113,536
7Sep 24, 2026 04:543,39837,115,26027,170,0001,035,0002,113,536
8Sep 24, 2026 04:543,43537,298,58827,511,0001,007,0002,113,536
9Sep 24, 2026 04:543,48738,293,50527,912,0001,035,0002,113,536