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 4, 2025 14:02Rajarshi BasuRajarshi BasuScore: 9,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 14:029,535103,387,22877,138,0002,003,0002,289,664
2Dec 4, 2025 14:029,567110,413,35078,399,0001,005,0002,486,272
3Dec 4, 2025 14:029,654109,178,06878,123,0002,003,0002,289,664
4Dec 4, 2025 14:029,756109,263,89378,974,0001,999,0002,289,664
5Dec 4, 2025 14:029,784105,780,34279,206,0002,005,0002,289,664
6Dec 4, 2025 14:029,792101,957,20179,271,0002,006,0002,289,664