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 listDec 24, 2024 12:03Sean DewarSean DewarScore: 58,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 12:0358,351510,436,062483,317,0001,000,0002,289,664
2Dec 24, 2024 12:0358,354510,280,517483,339,0001,000,0002,289,664
3Dec 24, 2024 12:0358,357508,599,807483,367,0001,000,0002,289,664
4Dec 24, 2024 12:0358,359510,274,565483,376,0001,000,0002,277,376
5Dec 24, 2024 12:0358,362514,521,067483,403,0001,000,0002,396,160
6Dec 24, 2024 12:0358,386510,880,282482,603,0001,998,0002,289,664
7Dec 24, 2024 12:0358,391516,253,114482,648,0001,998,0002,273,280
8Dec 24, 2024 12:0358,430510,666,585483,972,000999,0002,289,664
9Dec 24, 2024 12:0358,460508,140,194484,214,0001,000,0002,289,664