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 listMay 7, 2026 09:54wnwnScore: 3,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 09:543,38145,476,24127,009,0001,059,0002,482,176
2May 7, 2026 09:543,39845,104,76627,071,0001,133,0002,486,272
3May 7, 2026 09:543,39945,202,82527,144,0001,071,0002,482,176
4May 7, 2026 09:543,39944,959,92727,152,0001,060,0002,486,272
5May 7, 2026 09:543,40943,377,98227,197,0001,103,0002,494,464
6May 7, 2026 09:543,41443,418,50927,234,0001,108,0002,486,272
7May 7, 2026 09:543,42743,471,02627,376,0001,075,0002,482,176
8May 7, 2026 09:543,49645,081,76427,959,0001,065,0002,486,272
9May 7, 2026 09:543,54946,614,98128,380,0001,082,0002,486,272