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 25, 2025 21:43Adam FolwarcznyAdam FolwarcznyScore: 12,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 21:4312,531129,543,251101,007,0003,000,0002,400,256
2Aug 25, 2025 21:4312,531127,017,199101,010,0003,000,0002,449,408
3Aug 25, 2025 21:4312,532128,680,033101,015,0003,000,0002,453,504
4Aug 25, 2025 21:4312,533123,188,196101,026,0003,000,0002,457,600
5Aug 25, 2025 21:4312,534124,115,921101,034,0003,001,0002,400,256
6Aug 25, 2025 21:4312,534130,702,290101,035,0003,001,0002,412,544
7Aug 25, 2025 21:4312,544126,956,057101,113,0003,003,0002,400,256
8Aug 25, 2025 21:4312,545125,430,760101,123,0003,003,0002,453,504
9Aug 25, 2025 21:4312,557128,523,889101,220,0003,006,0002,400,256