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 16, 2026 23:13Tomislav TunkovicTomislav TunkovicScore: 5,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:105,61954,603,29546,640,000020,480
2Aug 17, 2026 05:105,61954,840,16446,638,000020,480
3Aug 17, 2026 05:105,62454,796,22446,682,000020,480
4Aug 17, 2026 05:105,62454,790,33746,685,000020,480
5Aug 17, 2026 05:105,62454,834,69246,687,000020,480
6Aug 17, 2026 05:105,62854,903,60946,720,000020,480
7Aug 17, 2026 05:105,62854,957,38746,714,000020,480
8Aug 17, 2026 05:105,62955,358,73346,724,000020,480
9Aug 17, 2026 05:105,67455,252,12147,099,000020,480