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 15, 2026 00:24Tomislav TunkovicTomislav TunkovicScore: 5,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 00:245,54954,539,98945,031,0001,027,0002,117,632
2Aug 15, 2026 00:245,55254,570,74745,061,0001,027,0002,117,632
3Aug 15, 2026 00:245,55454,557,08445,074,0001,027,0002,117,632
4Aug 15, 2026 00:245,55554,566,52345,081,0001,028,0002,117,632
5Aug 15, 2026 00:245,55754,603,64245,102,0001,028,0002,117,632
6Aug 15, 2026 00:245,55754,631,84945,102,0001,027,0002,117,632
7Aug 15, 2026 00:245,55954,647,68445,116,0001,028,0002,117,632
8Aug 15, 2026 00:245,56054,596,00945,126,0001,027,0002,117,632
9Aug 15, 2026 00:245,56854,689,21545,189,0001,029,0002,117,632