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 10:06wnwnScore: 7,254Success
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 10:066,24874,541,76649,864,0001,994,0002,383,872
2Feb 18, 2026 10:066,27079,425,01048,037,0004,003,0002,338,816
3Feb 18, 2026 10:066,36377,556,48949,827,0002,989,0002,453,504
4Feb 18, 2026 10:067,25487,074,42557,200,0003,010,0002,482,176
5Feb 18, 2026 10:067,33882,237,20858,910,0001,996,0002,424,832
6Feb 18, 2026 10:067,55689,224,42859,731,0002,986,0002,510,848