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 12:29Victor MerckléVictor MerckléScore: 3,909Success
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:303,88340,531,05531,042,0001,188,0002,117,632stderr
2Aug 11, 2026 12:303,88440,558,05731,068,0001,174,0002,117,632stderr
3Aug 11, 2026 12:303,88540,381,82631,155,0001,098,0002,117,632stderr
4Aug 11, 2026 12:303,88640,558,78231,139,0001,116,0002,117,632stderr
5Aug 11, 2026 12:303,90942,908,87931,251,0001,195,0002,117,632stderr
6Aug 11, 2026 12:303,91540,776,58431,379,0001,121,0002,117,632stderr
7Aug 11, 2026 12:303,92340,782,88831,444,0001,121,0002,117,632stderr
8Aug 11, 2026 12:304,02341,479,90132,224,0001,167,0002,117,632stderr
9Aug 11, 2026 12:304,02541,706,51432,306,0001,105,0002,117,632stderr