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 06:06Victor MerckléVictor MerckléScore: 6,129Success
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 06:076,11158,904,54649,668,0001,055,0002,113,536
2Aug 28, 2026 06:076,11858,954,30049,685,0001,102,0002,113,536
3Aug 28, 2026 06:076,12158,989,45349,749,0001,058,0002,113,536
4Aug 28, 2026 06:076,12459,881,50149,781,0001,053,0002,113,536
5Aug 28, 2026 06:076,12959,010,18149,819,0001,056,0002,113,536
6Aug 28, 2026 06:076,13659,992,16849,877,0001,060,0002,113,536
7Aug 28, 2026 06:076,13759,061,65749,850,0001,090,0002,113,536
8Aug 28, 2026 06:076,14159,320,28849,770,0001,206,0002,113,536
9Aug 28, 2026 06:076,14759,993,90249,879,0001,143,0002,113,536