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 26, 2026 16:33Kevin HeaveyKevin HeaveyScore: 3,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 16:343,19235,503,42326,501,000020,480
2Sep 26, 2026 16:343,20535,660,00526,609,000020,480
3Sep 26, 2026 16:343,20735,618,43226,619,000020,480
4Sep 26, 2026 16:343,20735,597,33726,623,000020,480
5Sep 26, 2026 16:343,21036,444,43025,628,0001,015,00020,480
6Sep 26, 2026 16:343,21235,671,10325,653,0001,012,00020,480
7Sep 26, 2026 16:343,22335,762,91725,749,0001,003,00020,480
8Sep 26, 2026 16:343,23335,920,74925,749,0001,085,00020,480
9Sep 26, 2026 16:343,25436,102,06626,000,0001,014,00020,480