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 listAug 11, 2025 18:27Leon ZhaoLeon ZhaoScore: 11,723Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 18:2711,459122,852,43694,111,0001,001,0002,285,568
2Aug 11, 2025 18:2711,467120,597,92093,172,0002,003,0002,469,888
3Aug 11, 2025 18:2711,476124,161,99293,248,0002,005,0002,285,568
4Aug 11, 2025 18:2711,723123,721,61696,294,0001,003,0002,289,664
5Aug 11, 2025 18:2711,724128,583,47996,304,0001,003,0002,285,568
6Aug 11, 2025 18:2711,731120,263,72695,363,0002,007,0002,285,568