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 listDec 6, 2025 11:26Rajarshi BasuRajarshi BasuScore: 7,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 11:267,27383,502,28858,358,0002,012,0002,289,664
2Dec 6, 2025 11:267,30888,686,90660,655,00002,265,088
3Dec 6, 2025 11:267,33895,631,99159,905,000998,0002,289,664
4Dec 6, 2025 11:267,47492,063,21860,037,0002,001,0002,281,472
5Dec 6, 2025 11:267,48295,304,90060,101,0002,003,0002,273,280
6Dec 6, 2025 11:267,53791,955,39761,545,0001,008,0002,273,280