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 10, 2026 10:01Victor MerckléVictor MerckléScore: 46,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 10:0146,662396,348,902386,276,0001,020,0002,117,632stderr
2Aug 10, 2026 10:0146,715396,718,662386,717,0001,019,0002,117,632stderr
3Aug 10, 2026 10:0146,721396,715,177386,773,0001,019,0002,117,632stderr
4Aug 10, 2026 10:0146,759396,519,374387,079,0001,026,0002,117,632stderr
5Aug 10, 2026 10:0146,806397,589,820387,485,0001,009,0002,117,632stderr
6Aug 10, 2026 10:0146,808397,707,894387,496,0001,012,0002,117,632stderr
7Aug 10, 2026 10:0146,841397,895,640387,648,0001,137,0002,117,632stderr
8Aug 10, 2026 10:0146,859397,404,151387,901,0001,031,0002,117,632stderr
9Aug 10, 2026 10:0146,867398,057,908387,977,0001,022,0002,117,632stderr