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 19:57Adam FolwarcznyAdam FolwarcznyScore: 12,564Success
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 19:5712,557124,120,964102,220,0002,004,0002,441,216
2Aug 25, 2025 19:5712,561131,511,494102,253,0002,004,0002,441,216
3Aug 25, 2025 19:5712,561130,410,592102,251,0002,004,0002,400,256
4Aug 25, 2025 19:5712,563127,247,347101,267,0003,007,0002,400,256
5Aug 25, 2025 19:5712,564127,896,470102,277,0002,005,0002,400,256
6Aug 25, 2025 19:5712,569129,239,902102,315,0002,006,0002,441,216
7Aug 25, 2025 19:5712,569123,177,384101,312,0003,009,0002,433,024
8Aug 25, 2025 19:5712,571129,073,203102,332,0002,006,0002,441,216
9Aug 25, 2025 19:5712,573123,630,743101,343,0003,010,0002,400,256