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 18:52Adam FolwarcznyAdam FolwarcznyScore: 15,032Success
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 18:5214,999150,535,501123,485,0001,003,0002,445,312
2Aug 25, 2025 18:5215,010144,107,992122,593,0001,993,0002,445,312
3Aug 25, 2025 18:5215,023154,095,393122,692,0001,995,0002,400,256
4Aug 25, 2025 18:5215,024154,775,660122,708,0001,995,0002,441,216
5Aug 25, 2025 18:5215,032152,484,356122,772,0001,996,0002,400,256
6Aug 25, 2025 18:5215,033151,519,413121,779,0002,994,0002,441,216
7Aug 25, 2025 18:5215,038148,466,337122,821,0001,997,0002,441,216
8Aug 25, 2025 18:5215,635155,146,500126,774,0002,994,0002,433,024
9Aug 25, 2025 18:5215,704154,260,134127,339,0003,008,0002,396,160