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 14:15wnwnScore: 3,465Success
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 14:153,29536,008,60926,306,0001,044,0002,113,536
2Sep 24, 2026 14:153,31336,149,64726,467,0001,033,0002,113,536
3Sep 24, 2026 14:153,32436,144,72326,586,0001,011,0002,113,536
4Sep 24, 2026 14:153,45037,238,39327,604,0001,038,0002,113,536
5Sep 24, 2026 14:153,46538,176,27327,762,0001,003,0002,113,536
6Sep 24, 2026 14:153,47438,272,95327,832,0001,007,0002,113,536
7Sep 24, 2026 14:153,48237,661,58327,878,0001,025,0002,113,536
8Sep 24, 2026 14:153,49738,577,20828,031,0001,001,0002,113,536
9Sep 24, 2026 14:153,51438,605,03028,166,0001,005,0002,113,536