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 27, 2026 17:58Victor MerckléVictor MerckléScore: 4,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:584,64146,686,41537,492,0001,036,0002,113,536
2Aug 27, 2026 17:584,67046,837,42337,699,0001,069,0002,113,536
3Aug 27, 2026 17:584,68248,010,94337,746,0001,116,0002,113,536
4Aug 27, 2026 17:584,69647,364,07037,863,0001,118,0002,113,536
5Aug 27, 2026 17:584,71447,361,77338,075,0001,054,0002,113,536
6Aug 27, 2026 17:584,74448,529,90438,276,0001,104,0002,113,536
7Aug 27, 2026 17:584,96750,243,25940,185,0001,044,0002,113,536
8Aug 27, 2026 17:585,00450,631,93740,480,0001,059,0002,113,536
9Aug 27, 2026 17:585,20252,197,38042,112,0001,068,0002,113,536