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 26, 2026 18:28olliecrowolliecrowScore: 6,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:296,24467,166,72048,840,0002,990,0002,412,544
2Apr 26, 2026 18:296,26168,836,97948,969,0002,998,0002,457,600
3Apr 26, 2026 18:296,28170,298,57049,129,0003,007,0002,519,040
4Apr 26, 2026 18:296,29073,247,62248,199,0004,016,0002,478,080
5Apr 26, 2026 18:296,29168,238,80549,206,0003,012,0002,441,216
6Apr 26, 2026 18:296,34170,282,59151,619,0001,012,0002,469,888
7Apr 26, 2026 18:296,34267,479,09050,619,0002,024,0002,482,176
8Apr 26, 2026 18:296,34871,075,04848,713,0003,976,0002,400,256
9Apr 26, 2026 18:296,41673,219,15449,239,0004,019,0002,506,752