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 18, 2025 21:04Adam FolwarcznyAdam FolwarcznyScore: 42,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 21:0442,378376,375,222350,742,000999,0002,392,064
2Aug 18, 2025 21:0442,394377,513,631349,869,0001,999,0002,383,872
3Aug 18, 2025 21:0442,449372,703,230351,327,0001,000,0002,383,872
4Aug 18, 2025 21:0442,474384,477,195352,537,00002,383,872
5Aug 18, 2025 21:0442,489375,084,549350,659,0001,998,0002,519,040
6Aug 18, 2025 21:0442,489384,787,264350,662,0001,998,0002,260,992
7Aug 18, 2025 21:0442,520379,410,471350,916,0001,999,0002,519,040
8Aug 18, 2025 21:0442,561378,139,712352,256,0001,000,0002,260,992
9Aug 18, 2025 21:0442,761382,784,472352,921,0001,999,0002,260,992