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:22Victor MerckléVictor MerckléScore: 4,663Success
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:224,58846,426,11336,978,0001,110,0002,117,632stderr
2Aug 26, 2026 23:224,61546,790,50837,140,0001,168,0002,117,632stderr
3Aug 26, 2026 23:224,62646,584,26237,251,0001,151,0002,117,632stderr
4Aug 26, 2026 23:224,63247,511,72537,333,0001,118,0002,117,632stderr
5Aug 26, 2026 23:224,66347,082,54337,552,0001,159,0002,117,632stderr
6Aug 26, 2026 23:224,78748,100,91538,676,0001,063,0002,117,632stderr
7Aug 26, 2026 23:224,80448,877,17238,798,0001,080,0002,117,632stderr
8Aug 26, 2026 23:224,86849,423,28439,371,0001,039,0002,117,632stderr
9Aug 26, 2026 23:224,94049,331,85239,942,0001,068,0002,117,632stderr