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 listMar 17, 2026 12:05shartgepettoshartgepettoScore: 7,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 12:057,23183,121,40556,015,0004,001,0002,387,968
2Mar 17, 2026 12:057,26282,073,17956,257,0004,018,0002,355,200
3Mar 17, 2026 12:057,27986,548,62556,386,0004,027,0002,351,104
4Mar 17, 2026 12:057,28387,122,54957,424,0003,022,0002,404,352
5Mar 17, 2026 12:057,29086,440,58856,474,0004,033,0002,465,792
6Mar 17, 2026 12:057,31685,317,37354,747,0005,972,0002,486,272
7Mar 17, 2026 12:057,35084,728,41457,002,0004,000,0002,461,696
8Mar 17, 2026 12:057,35184,744,81659,012,0002,000,0002,326,528
9Mar 17, 2026 12:057,38783,946,70057,291,0004,020,0002,416,640