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 17, 2025 06:04Aleksei ShahoikaAleksei ShahoikaScore: 19,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 06:0419,145185,096,507156,904,0001,998,0002,506,752
2Sep 17, 2025 06:0419,171182,335,320157,115,0002,001,0002,260,992
3Sep 17, 2025 06:0419,172183,728,257157,125,0002,001,0002,269,184
4Sep 17, 2025 06:0419,176188,782,000157,160,0002,002,0002,285,568
5Sep 17, 2025 06:0419,180179,854,746158,189,0001,001,0002,285,568
6Sep 17, 2025 06:0419,183185,762,856157,220,0002,002,0002,510,848
7Sep 17, 2025 06:0419,195181,740,794157,317,0002,004,0002,260,992
8Sep 17, 2025 06:0419,202189,656,787159,377,00002,285,568
9Sep 17, 2025 06:0419,205185,826,758158,402,0001,002,0002,355,200