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 listApr 28, 2026 08:59TudyMTudyMScore: 38,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:0338,826340,740,406321,259,0001,000,0002,392,064
2Apr 28, 2026 09:0338,836342,992,696319,349,0002,993,0002,379,776
3Apr 28, 2026 09:0338,842341,406,743321,389,0001,001,0002,375,680
4Apr 28, 2026 09:0338,850344,753,836321,461,0001,001,0002,383,872
5Apr 28, 2026 09:0338,856339,105,651321,509,0001,001,0002,396,160
6Apr 28, 2026 09:0338,856342,369,286320,514,0001,996,0002,379,776
7Apr 28, 2026 09:0338,868340,684,468321,604,0001,001,0002,383,872
8Apr 28, 2026 09:0338,875340,830,969319,669,0002,996,0002,318,336
9Apr 28, 2026 09:0338,897339,626,137319,852,0002,998,0002,306,048