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 5, 2025 02:59Drew GarciaDrew GarciaScore: 54,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2025 02:5954,482476,187,298433,196,00019,008,0002,318,336
2Aug 5, 2025 02:5954,530478,955,981442,610,0009,991,0002,310,144
3Aug 5, 2025 02:5954,534481,310,440437,645,00014,987,0002,424,832
4Aug 5, 2025 02:5954,535477,257,205436,654,00015,987,0002,428,928
5Aug 5, 2025 02:5954,539474,392,336436,682,00015,988,0002,433,024
6Aug 5, 2025 02:5954,539476,127,886439,683,00012,990,0002,310,144
7Aug 5, 2025 02:5954,552479,510,064438,785,00013,993,0002,310,144
8Aug 5, 2025 02:5954,593479,020,009437,122,00016,004,0002,310,144
9Aug 5, 2025 02:5954,644484,990,143435,567,00017,982,0002,433,024