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 30, 2025 21:45Adam FolwarcznyAdam FolwarcznyScore: 10,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 21:459,897108,071,16048,495,00033,650,0002,478,080
2Aug 30, 2025 21:4510,019111,121,58848,511,00034,650,0002,342,912
3Aug 30, 2025 21:4510,077110,372,04655,758,00027,879,0002,408,448
4Aug 30, 2025 21:4510,094109,187,46750,269,00033,512,0002,510,848
5Aug 30, 2025 21:4510,123110,183,50851,402,00032,620,0002,465,792
6Aug 30, 2025 21:4510,149111,709,70848,562,00035,678,0002,322,432