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 listAug 26, 2026 23:07Victor MerckléVictor MerckléScore: 3,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:083,88840,696,83931,174,0001,102,0002,117,632stderr
2Aug 26, 2026 23:083,90040,775,58431,295,0001,077,0002,117,632stderr
3Aug 26, 2026 23:083,91240,861,80131,312,0001,159,0002,117,632stderr
4Aug 26, 2026 23:083,92640,958,21631,302,0001,288,0002,117,632stderr
5Aug 26, 2026 23:083,93841,172,53831,494,0001,197,0002,117,632stderr
6Aug 26, 2026 23:083,94841,114,75331,632,0001,139,0002,117,632stderr
7Aug 26, 2026 23:084,20848,777,08633,739,0001,194,0002,117,632stderr
8Aug 26, 2026 23:084,25953,541,64334,181,0001,175,0002,117,632stderr
9Aug 26, 2026 23:084,28353,357,49834,451,0001,098,0002,117,632stderr