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 11, 2026 11:59Victor MerckléVictor MerckléScore: 3,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 12:003,89640,670,92031,178,0001,164,0002,117,632stderr
2Aug 11, 2026 12:003,90340,701,99131,280,0001,115,0002,117,632stderr
3Aug 11, 2026 12:003,90940,619,42231,237,0001,211,0002,117,632stderr
4Aug 11, 2026 12:003,91542,225,86731,394,0001,101,0002,117,632stderr
5Aug 11, 2026 12:003,92340,685,17531,455,0001,111,0002,117,632stderr
6Aug 11, 2026 12:003,92840,816,85731,492,0001,115,0002,117,632stderr
7Aug 11, 2026 12:003,92941,048,98731,500,0001,117,0002,117,632stderr
8Aug 11, 2026 12:003,94741,074,17131,637,0001,125,0002,117,632stderr
9Aug 11, 2026 12:004,02641,633,09832,297,0001,123,0002,117,632stderr