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:05Victor MerckléVictor MerckléScore: 3,926Success
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:053,86440,462,91130,923,0001,150,0002,117,632stderr
2Aug 26, 2026 23:053,87040,645,47030,907,0001,214,0002,117,632stderr
3Aug 26, 2026 23:053,91340,890,15631,321,0001,157,0002,117,632stderr
4Aug 26, 2026 23:053,92140,940,65831,458,0001,093,0002,117,632stderr
5Aug 26, 2026 23:053,92641,004,25631,379,0001,211,0002,117,632stderr
6Aug 26, 2026 23:053,93040,942,82031,520,0001,101,0002,117,632stderr
7Aug 26, 2026 23:053,93941,063,60931,616,0001,082,0002,117,632stderr
8Aug 26, 2026 23:053,94041,727,88931,681,0001,021,0002,117,632stderr
9Aug 26, 2026 23:053,94741,163,45631,694,0001,071,0002,117,632stderr