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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 11:543,78739,903,48030,305,0001,131,0002,117,632stderr
2Aug 12, 2026 11:543,78939,822,40830,375,0001,076,0002,117,632stderr
3Aug 12, 2026 11:543,79040,027,49030,384,0001,077,0002,117,632stderr
4Aug 12, 2026 11:543,79839,924,36730,439,0001,090,0002,117,632stderr
5Aug 12, 2026 11:543,80139,987,46530,441,0001,115,0002,117,632stderr
6Aug 12, 2026 11:543,80139,798,42130,407,0001,147,0002,117,632stderr
7Aug 12, 2026 11:543,80640,020,89330,444,0001,152,0002,117,632stderr
8Aug 12, 2026 11:543,84740,163,71930,862,0001,075,0002,117,632stderr
9Aug 12, 2026 11:543,92641,027,65331,483,0001,108,0002,117,632stderr