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 listFeb 15, 2026 23:18wnwnScore: 8,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:187,16082,994,83853,388,0006,043,0002,371,584
2Feb 15, 2026 23:187,21882,243,02252,922,0006,989,0002,334,720
3Feb 15, 2026 23:187,35786,927,27350,054,00011,011,0002,449,408
4Feb 15, 2026 23:188,25495,001,53159,440,0009,067,0002,441,216
5Feb 15, 2026 23:188,36695,856,18858,366,00011,069,0002,326,528
6Feb 15, 2026 23:188,37289,169,79560,426,0009,063,0002,465,792
7Feb 15, 2026 23:188,46499,531,11162,223,0008,028,0002,387,968
8Feb 15, 2026 23:188,46694,010,98862,234,0008,030,0002,281,472
9Feb 15, 2026 23:188,48693,545,03159,363,00011,067,0002,392,064
10Feb 15, 2026 23:188,49398,031,11860,425,00010,070,0002,514,944
11Feb 15, 2026 23:188,51498,996,40264,695,0005,971,0002,514,944
12Feb 15, 2026 23:188,575102,260,52161,148,00010,024,0002,473,984