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 24, 2026 06:43olliecrowolliecrowScore: 78,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 06:4678,396671,311,529647,696,0002,998,0002,326,528
2Apr 24, 2026 06:4678,399659,246,715647,716,0002,998,0002,375,680
3Apr 24, 2026 06:4678,407659,267,062647,782,0002,998,0002,326,528
4Apr 24, 2026 06:4678,419661,447,158648,881,0001,999,0002,359,296
5Apr 24, 2026 06:4678,423659,484,840648,918,0001,999,0002,359,296
6Apr 24, 2026 06:4678,438659,714,569649,037,0002,000,0002,551,808
7Apr 24, 2026 06:4678,447659,851,280649,112,0002,000,0002,375,680
8Apr 24, 2026 06:4678,504659,559,160647,591,0003,997,0002,371,584
9Apr 24, 2026 06:4678,520659,435,796648,721,0002,998,0002,375,680