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 12, 2026 15:55Victor MerckléVictor MerckléScore: 3,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 15:563,75939,609,04230,090,0001,110,0002,117,632stderr
2Aug 12, 2026 15:563,78339,800,34330,298,0001,105,0002,117,632stderr
3Aug 12, 2026 15:563,78440,495,64030,212,0001,200,0002,117,632stderr
4Aug 12, 2026 15:563,78739,830,21130,341,0001,092,0002,117,632stderr
5Aug 12, 2026 15:563,79440,588,61930,348,0001,148,0002,117,632stderr
6Aug 12, 2026 15:563,79539,896,38030,392,0001,114,0002,117,632stderr
7Aug 12, 2026 15:563,82440,154,25930,636,0001,104,0002,117,632stderr
8Aug 12, 2026 15:563,86040,485,47031,018,0001,021,0002,117,632stderr
9Aug 12, 2026 15:563,86940,542,29831,020,0001,097,0002,117,632stderr