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 18, 2026 22:19wnwnScore: 5,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:195,54770,494,90744,041,0002,001,0002,531,328
2Feb 18, 2026 22:195,55367,405,90345,086,0001,001,0002,441,216
3Feb 18, 2026 22:195,59069,987,68846,400,00002,445,312
4Feb 18, 2026 22:205,60078,668,38544,456,0002,020,0002,441,216
5Feb 18, 2026 22:195,61272,041,41844,557,0002,025,0002,539,520
6Feb 18, 2026 22:205,61472,978,97845,586,0001,013,0002,445,312
7Feb 18, 2026 22:195,61674,190,51545,600,0001,013,0002,449,408
8Feb 18, 2026 22:205,77969,019,38245,967,0001,998,0002,535,424
9Feb 18, 2026 22:195,78375,691,10644,996,0002,999,0002,539,520