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 27, 2026 09:59wnwnScore: 3,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:003,43447,431,08727,489,0001,018,0002,482,176
2Apr 27, 2026 10:003,44344,121,07227,564,0001,020,0002,482,176
3Apr 27, 2026 10:003,47845,018,90126,882,0001,991,0002,490,368
4Apr 27, 2026 10:003,48246,632,86526,908,0001,993,0002,486,272
5Apr 27, 2026 10:003,51046,598,68628,137,0001,004,0002,482,176
6Apr 27, 2026 10:003,55749,718,15228,507,0001,018,0002,486,272
7Apr 27, 2026 10:003,61749,750,50528,027,0002,001,0002,494,464
8Apr 27, 2026 10:003,61946,180,28528,042,0002,003,0002,486,272
9Apr 27, 2026 10:003,62843,840,89328,108,0002,007,0002,330,624