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 listMar 18, 2026 06:03Elijah KinElijah KinScore: 49,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 06:0349,752437,043,806409,940,0002,999,0002,273,280
2Mar 23, 2026 17:3549,758439,185,181410,995,0001,999,0002,281,472
3Mar 23, 2026 17:3549,761437,279,890410,013,0003,000,0002,269,184
4Mar 18, 2026 06:0349,769435,690,952411,081,0002,000,0002,273,280
5Mar 18, 2026 06:0349,770434,118,711411,089,0002,000,0002,273,280
6Mar 23, 2026 17:3549,806440,457,031412,391,0001,000,0002,277,376