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 28, 2026 18:47Victor MerckléVictor MerckléScore: 6,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:506,05058,625,52149,166,0001,054,0002,117,632stderr
2Aug 28, 2026 18:506,06858,766,84449,256,0001,113,0002,117,632stderr
3Aug 28, 2026 18:506,08859,684,30849,459,0001,073,0002,117,632stderr
4Aug 28, 2026 18:506,09659,535,93049,555,0001,050,0002,117,632stderr
5Aug 28, 2026 18:506,09859,679,87749,560,0001,061,0002,117,632stderr
6Aug 28, 2026 18:506,11359,800,63649,667,0001,073,0002,117,632stderr
7Aug 28, 2026 18:506,11459,755,24249,673,0001,075,0002,117,632stderr
8Aug 28, 2026 18:506,14260,000,23249,907,0001,079,0002,117,632stderr
9Aug 28, 2026 18:506,17360,322,67650,166,0001,076,0002,117,632stderr