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 21, 2026 18:38Daniel MastalerzDaniel MastalerzScore: 8,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:388,25694,823,92565,501,0003,023,0002,285,568
2Feb 21, 2026 18:388,36693,205,16665,416,0004,025,0002,310,144
3Feb 21, 2026 18:388,43997,308,77367,041,0003,001,0002,330,624