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 20:52Victor MerckléVictor MerckléScore: 7,593Success
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 20:537,55571,147,46761,540,0001,172,0002,117,632stderr
2Aug 26, 2026 20:537,56271,148,30561,583,0001,186,0002,117,632stderr
3Aug 26, 2026 20:537,57071,870,06261,666,0001,167,0002,117,632stderr
4Aug 26, 2026 20:537,58971,354,11061,816,0001,174,0002,117,632stderr
5Aug 26, 2026 20:537,59371,391,18361,949,0001,076,0002,117,632stderr
6Aug 26, 2026 20:537,64571,756,17662,375,0001,079,0002,117,632stderr
7Aug 26, 2026 20:537,68272,145,81362,687,0001,080,0002,117,632stderr
8Aug 26, 2026 20:537,69672,208,71162,865,0001,014,0002,117,632stderr
9Aug 26, 2026 20:537,87274,368,63364,222,0001,119,0002,117,632stderr